4
2
2
(Choose 1 answer)
Using Prim's algorithm to find a minimal spanning tree. What is the list of edges chosen?
A. CE, BC, AB, EZ, DZ
AO
2
4
3
6
3
B. CE, BC, AB, BD, DZ
C. CE, BC, AB. DZ, EZ
D. AB, BC, CE, BD, DZ
CO
1
38/50-CAP
E. None of the other choices is correct
Rsh
Q: 40
zQ
