10.2: Spanning Trees 13) Use Prim's Algorithm to find a minimal spanning tree for the following graphs and calculate the cost associated. Start at vertex A. a) B -6- -6- -3 b) 120 E 80 80 100 30 60 200 90 70 150 c) 3 10 10 C 12 D N A 6 E 3 6 8 G -8- 10.3: Rooted Trees 14) Use Kruskal's algorithm to find a minimal spanning tree for the following graph and calculate the cost associated. In addition to the spanning tree, find the final rooted tree in the algorithm. When you merge two trees in the algorithm, make the root with the lower number the root of the new tree