4.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{5fa867a2-0a3d-4f0b-9f9c-15584f2be5c0-05_879_1068_248_497}
\captionsetup{labelformat=empty}
\caption{Figure 2}
\end{figure}
[The total weight of the network is 73.3 km ]
Figure 2 models a network of tunnels that have to be inspected. The number on each arc represents the length, in km , of that tunnel.
Malcolm needs to travel through each tunnel at least once and wishes to minimise the length of his inspection route.
He must start and finish at A .
- Use the route inspection algorithm to find the tunnels that will need to be traversed twice. You should make your method and working clear.
- Find a route of minimum length, starting and finishing at A .
State the length of your route.
A new tunnel, CG, is under construction. It will be 10 km long.
Malcolm will have to include the new tunnel in his inspection route. - What effect will the new tunnel have on the total length of his route?
Justify your answer.