2.
| \(A\) | B | \(C\) | D | \(E\) | \(F\) | \(G\) |
| A | - | 48 | 117 | 92 | - | - | - |
| B | 48 | - | - | - | - | 63 | 55 |
| C | 117 | - | - | 28 | - | - | 85 |
| D | 92 | - | 28 | - | 58 | 132 | - |
| E | - | - | - | 58 | - | 124 | - |
| \(F\) | - | 63 | - | 132 | 124 | - | - |
| G | - | 55 | 85 | - | - | - | - |
The table shows the lengths, in metres, of the paths between seven vertices \(A , B , C , D , E , F\) and \(G\) in a network N.
- Use Prim's algorithm, starting at \(A\), to solve the minimum connector problem for this table of distances. You must clearly state the order in which you selected the edges of your tree, and the weight of your final tree. Draw your tree using the vertices given in Diagram 1 in the answer book.
- Draw N using the vertices given in Diagram 2 in the answer book.
- Solve the Route Inspection problem for N. You must make your method of working clear. State a shortest route and find its length. (The weight of N is 802 .)
(7)
\section*{3.}