10. (8 pts) For the weighted graph below, find the minimal spanning tree using (a) Prim's algorithm starting with a vertex of your choice, and (b) Kruskal's algorithm. For both algorithms, label the edges in the order that they were added to the tree and calculate the total weight. (For this problem, it is OK to mark up the diagrams on this sheet and turn it in.)
Kruskal's Prim: (start at vertex "k")
Total weight -
Total weight -