5. [4+1+1=6 points ] Use a step-by-step approach to derive the minimum spanning tree (MST) for the following graph (Figure 2) using Prim's algorithm. Determine the final sum of all the edge weights in the MST. Finally, tabulate the edge weights against the corresponding edges in the ascenc" Figure 2