27

Identify a minimum spanning tree (MST) in the graph below using Kruskal's algorithm. Write down the edges in the MST in the order in which Kruskal's algorithm adds them to the tree and make those edges into solid lines. Also write down the total weight of the minimum spanning tree that you have identified