7. Given the following weighted graph, show the order in which the edges are added to the minimnum cost spanning tree using Kruskal's algorithm. (Use weight to represent edges in your answer and just show the order.)