Question 15 (10 points)
Use Kruskal's algorithm to create a minimum spanning tree for the following graph. Draw your steps on your own draft paper using notation as described in class (you do not need to submit this). Show in the text field below the sequence of edges in the order that the algorithm adds them, in the format of (vertex1, vertex2, weight order), for example (F, G, 1, 1, G, C, 1, 2),..
A
6
10
7
B
3
C
9
H
G
Edges in the order that the algorithm adds them:
