Minimum spanning tree - Computer Networking

Minimum spanning tree – Computer Networking

A – (a,b), (a,h), (g,h), (f,g), (c,f), (c,i), (c,d), (d,e)

B – (a,b), (b,h), (g,h), (g,i), (c,i), (c,f), (c,d), (d,e)

C – (a,b), (b,c), (c,i), (c,f), (f,g), (g,h), (c,d), (d,e)

D – (a,b), (g,h), (g,f), (c,f), (c,i), (f,e), (b,c), (d,e)

Answer: C
Explanation:
According to UGC option C is correct but if you solve using Prim’s algo. you will get option A is also correct