- This question should be answered on the sheet provided.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{e892e87c-1c2d-4f97-ac23-41e38663d0f0-02_485_995_285_477}
\captionsetup{labelformat=empty}
\caption{Fig. 1}
\end{figure}
The network in Figure 1 shows the distances, in miles, between the five villages in which Sarah is planning to enquire about holiday work, with village \(A\) being Sarah's home village.
- Illustrate this situation as a complete network showing the shortest distances.
(2 marks) - Use the nearest neighbour algorithm, starting with \(A\), to find an upper bound to the length of a tour beginning and ending at \(A\).
(2 marks) - Interpret the tour found in part (b) in terms of the original network.
(2 marks)