3 The following network shows the roads connecting seven villages, \(A , B , C , \ldots , G\). The number on each edge represents the length, in miles, between a pair of villages.
\includegraphics[max width=\textwidth, alt={}, center]{5a414265-6273-41c5-ad5f-f6316bd774d0-06_978_1108_443_466}

1. Use Kruskal's algorithm to find a minimum spanning tree for the network. (5 marks)
2. State the length of your minimum spanning tree.
3. There are two minimum spanning trees for this network. Draw both of these minimum spanning trees.