Use a step-by-step approach to derive the minimum spanning tree (MST) for the following graph (Figure 1) using Kruskal'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 ascending order.

Figure