1. (25 points) Use Prim's Algorithm to find a) a minimum spanning tree and b) the cost of the minimum spanning tree for the following graph. Show steps. (Assume that the algorithm starts from v1) 2. ( 25 points) Use Kruskal's Algorithm to find a) a minimum spanning tree and b) the cost of the minimum spanning tree for the above graph. Show steps.
