Answer (Choose 1 answer)
Using Kruskal's algorithm to find a minimal spanning tree. What is the list of edges chosen?
A. CE, BC, AB, BD, DZ
B. CE, DZ, AB, BC, BD
C. None of the other choices is correct
D. CE, DZ, AB, BC, BE
E. CE, BC, AB, DZ, BD
3
2
1
2
4
3
6
4
CO
1
(10)
