Run the Kruskal's algorithm for minimum weight spanning tree on the graph assigned to you. If any edge does not have weight assigned, assume the weight of that edge to be 5. Show your work for each iteration in the skeletal graphs (see next page). For each skeletal graph, indicate the vertices and all the edges that are selected as part of the particular iteration as well as carried over from the previous iterations.

Show all the steps.

0 2 7 8 3 4 3 3