4. (10 pts) (a) Suppose we want to find the minimum spanning tree of the graph shown on Figure 1. Run Prim's algo- rithm; whenever there is a choice of nodes, always use alphabetic ordering (e.g., start from node A). Draw a table showing the intermediate values at every stage. 7 6 Figure 1: Input graph for Question 4