Question 2.89
59. Use Kruskal's algorithm to find a minimum-cost spanning tree for the following graphs (a), (b), (c), and (d). In each case, what is the cost associated with the tree?
59.
(a) 1, 2, 3, 4, 5, 8; cost is 23.
(b) 1, 1, 1, 2, 2, 3, 3, 4, 5, 6, 6; cost is 34.
(c) 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 5, 5, 6, 7; cost is 60.
(d) 1, 2, 2, 3, 3, 3, 4, 5, 5, 5, 6, 6; cost is 45.