Q. 9 Consider the following graph:
Which one of the following cannot be the sequence of edges added, in that order, to a minimum spanning tree using Kruskal’s algorithm?
(A) (a – b),(d – f),(b – f).( d – c),(d – e)
(B) (a – b),(d – f),(b – c),(b – f),(d – e)
(C) (d – f),(a – b),(d – c),(d – e),(d – e)
(D) (d – f),(a – b),(b – f),(d – e),(d – e)
Answer: (D)
Explanation: 
