5.

\begin{figure}[h]
\begin{center}
  \includegraphics[alt={},max width=\textwidth]{0360f78d-e18c-4c47-a2ec-ddd705a4175f-6_867_1381_260_342}
\captionsetup{labelformat=empty}
\caption{Figure 5}
\end{center}
\end{figure}

[The total weight of the network is 31.6 km ]\\
Figure 5 models a network of roads. The road markings on these roads are to be renewed. The number on each arc represents the length, in km , of that road. In order to renew the road markings, each road must be traversed at least once.
\begin{enumerate}[label=(\alph*)]
\item Use the route inspection algorithm, starting and finishing at A , to find a suitable route, which should be stated. You must make your method and working clear.
\item State the roads that must be traversed twice and the length of the route.\\
(3)

The machine that will be used to renew the road markings can only be delivered to D . It will start at D, but it may finish at any vertex.\\
Each road must still be traversed at least once.
\item Given that the route is to be minimised, determine where the machine should finish. Give reasons to justify your answer.\\
(3)
\end{enumerate}

\hfill \mbox{\textit{Edexcel D1 2011 Q5 [11]}}