Answer (Choose 1 answer)
(See picture)
A. AD
B. BD
C. None of the other choices is correct
D. EC
E. EF
If using the Kruskal's algorithm to find a minimum spanning tree T from the graph below, which edge is added to T in the last step?
1
6
3
1
2
5
5
1
4
F
Exit 7
