Given the above weighted undirected graph $G1$ with ten vertices $v1,$dots,$v10$ :

a$)(20$ pts$)$ Use Prim's Algorithm to find a minimum spanning tree starting with v$1$

and its cost. Show your work.

b$)(20$ pts$)$ Use Kruskal's Algorithm 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 G$1?$ Discuss why.