= = Problem 4: Consider the graph Gonn - 7 vertices V = {1,2,3,4,5,6,7} with edges E = {(1,2), (1,4), (2,3), (2,5), (2,7), (3, 4), (3,5), (4,5),(4,6), (4,7), (5,6), (6,7)}, and with edge weights (in the previous order of edges) W1,2 = 9, W1,4 = 7, W2,3 = 9, W2,5 = 10, W2,7 = 7, W3,4 = 8, W3,5 9, W4,5 = 9, W4,6 = 8, W4,7 = 8, W5,6 = 7, W6,7 = 7. What is the weight of the maximum-weight spanning tree? Compute the sequence of edges chosen by Kruskal's algorithm