8. Use Kruskal's algorithm to find the minimum cost spanning tree (MCST) of the graph in Figure 4. Show your work step by step and draw the graph at each step. (10%)

Figure 4