1 A		 6 D		15 D		20 B

2 C		 7 B		16 A		21 C

3 C		 8 G		17 B		22 C
	
4 B		 9 B		18 C		23 B

5 E		13 B		19 D		24 A

10. Kruskal's algorithm picks the edges in the following order:

Group 1 (edges with weight 1)

KL, BC, EF all three in any (random) order

Group 2 (edges with weight 2; leaving those that will close a circuit out)

EC, IK, EH, BD, DG in any order, but after all three edges Group 1 are picked.

Group 3 (edges with weight 3; leaving those that will close a circuit out )

JK, and (IF or FL, only one of these) in any order

Group 4 (edges with weight 4; leaving those that will close a circuit out)

either AB or AD (only one of them)

The total number of edges picked is 11, which is one less than the number of vertices.

11. Prim's algorithm picks the edges in the following order:

14. The length of the minimum spanning network is 78 + 53 = 131

25. 1) P₂₀ = P₁ + 19(7)

= 10 + 19 ( 7)

= 143

2) P₁ + P₂ + … + P₂₀ = 20 (P₁ + P₂₀)/2

= 20 (10 + 143)/2

= 10 (153)

= 1530