Use Kruskal's algorithm to solve the minimum weight spanning tree problem in the graph below. 6 7 g f 6 18 17 10 b 20 4 4 d 20 6 20 17 The weight of the first edge included in the minimum weight spanning tree is 11 The weight of the second edge included in the minimum weight spanning tree is The weight of the third edge included in the minimum weight spanning tree is The weight of the fourth edge included in the minimum weight spanning tree is The weight of the fifth edge included in the minimum weight spanning tree is The weight of the sixth edge included in the minimum weight spanning tree is The total weight of the minimum weight spanning tree is