单选题：To find the minimum spanning tree with Prim's algorithm from v1

To find the minimum spanning tree with Prim's algorithm from v1 for the following graph. Which edge will be added in the final step? @[C](2)


A. (v1,v2)
B. (v3,v4)
C. (v5,v6)
D. uncertain




A.(v1,v2)
B.(v3,v4)
C.(v5,v6)
D.uncertain


答案：C