Please give typed answers. If answers can't be typed please write as clear and neat as possible.

1. Use Kruskal's algorithm to find the minimum spanning trees for the two graphs below. Write edgesin the order of the times when the edge are planed into the minimum spanning tree by the Kruskal's algorithms. 35 25 1 4 5 9 13 1 10 11 20 30 23 12 22 14 15 7 18 15 2 12 5 9 2 25 8 10 0 7 11 120 11 20 4 (a) (b) Figure 1