In this problem, you will show the execution of the minimumspanning tree algorithms on the following graph:
(a) (15 points) Trace the execution of Prim’s algorithm to findthe minimum spanning tree for this graph. At each step, you shouldshow the vertex and the edge added to the tree and the resultingvalues of D after the relaxation operation. Use START vertex as thefirst vertex in your traversal.
(b) (15 points) Trace the execution of Kruskal’s algorithm tofind the minimum spanning tree for this graph. Give a list of edgesin
OR
OR