Minimum Spanning Tree (a) There is a weighted undirected graph in Fig. 5. There are six nodes, A, B, C, D, E, and F. The value beside each edge is its weight. Now you are executing the Kruskal algorithm to compute the minimum spanning tree on this graph. Instead of drawing the tree, all you need to do is to list the edges in the resulting MST, in the order of the time they are added to the MST. (b) There is a weighted undirected graph in Fig. 6. There are six nodes, A, B, C, D, E, and F. The value beside each edge is its weight. Now you are executing the Prim algorithm to compute the minimum spanning tree on this graph, starting with vertex A. Instead of drawing the tree, all you need to do is to list the edges in the resulting MST, in the order of the time they are added to the MST