2 Answer this question on the insert provided.
The diagram shows a directed network of paths with vertices labelled with (stage; state) labels. The weights on the arcs represent distances in km . The shortest route from \(( 3 ; 0 )\) to \(( 0 ; 0 )\) is required.
Complete the dynamic programming tabulation on the insert, working backwards from stage 1 , to find the shortest route through the network. Give the length of this shortest route.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{9c9b1a42-8d16-446a-85a1-4c08e5e368be-2_501_1018_1741_575}
\captionsetup{labelformat=empty}
\caption{Stage 3 Stage 2 Stage 1}
\end{figure}