Use the following graph to trace through Prim’s and Kruskal’…
Use the following graph to trace through Prim’s and Kruskal’s MST algorithms. When a starting point is needed, use the node C as this starting point. Then answer the four questions about these traces. Use the notation XY for edges where X and Y are the two nodes the edge connects, listing the nodes in alphabetic order. How many edges must an MST for this graph contain? What is the first edge added to the MST when tracing through Prim’s algorithm? What is the first edge added to the MST when tracing through Kruskal’s algorithm? What is the last edge added to this MST (both algorithms should yield the same answer)?