The table below shows the lengths, in km , of the roads in a network connecting seven towns, \(\mathrm { A } , \mathrm { B } , \mathrm { C } , \mathrm { D } , \mathrm { E } , \mathrm { F }\) and G .
A
B
C
D
E
F
G
A
-
24
-
22
35
-
-
B
24
-
25
27
-
-
-
C
-
25
-
33
31
36
26
D
22
27
33
-
-
42
-
E
35
-
31
-
-
37
29
F
-
-
36
42
37
-
40
G
-
-
26
-
29
40
-
By adding the arcs from vertex D along with their weights, complete the drawing of the network on Diagram 1 in the answer book.
Use Kruskal's algorithm to find a minimum spanning tree for the network. You should list the arcs in the order that you consider them. In each case, state whether you are adding the arc to your minimum spanning tree.