V3 9 19 37 4) 23 6 18 13 3 v2 131 12 21 7 V10 G2 VI 4 V2 - 6 Given the above weighted undirected graph G1 with ten vertices v1,...,v10: a) (20 pts) Use Prim's Algorithm to find a minimum spanning tree starting with v1 and its cost. Show your work. b) (20 pts) Use Kruskal's Algoirhtms to find a minimum spanning tree and its cost. Show your work. c) (10 pts) Which of the two algorithms above is more efficient than the other for finding a MST in G1? Discuss why.