3. In this problem, you will show the execution of the minimum spanning tree algorithms that you studied in class on the following graph: START 10 40 20 5 35 38 8 15 30 6 41 12 66 62 (a) (5 points) Trace the execution of Prim's algorithm to find the minimum spanning tree for this graph. At each step, you should show the vertex and the edge added to the tree and the resulting values of D after the relaxation operation. Use START vertex as the first vertex in your traversal. (b) (5 points) Trace the execution of Kruskal's algorithm to find the minimum spanning tree for this graph. Give a list of edges in the order in which they are added to the MST.