6.
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{931ccf1d-4b02-448c-b492-846b0f42c057-07_709_1507_214_280}
\captionsetup{labelformat=empty}
\caption{Figure 2}
\end{figure}
The staged, directed network in Figure 2 represents the roads that connect 12 towns, S, A, B, C, D, E, F, G, H, I, J and T. The number on each arc shows the time, in hours, it takes to drive between these towns.
Elena plans to drive from S to T . She must arrive at T by 9 pm .
- By completing the table in the answer book, use dynamic programming to find the latest time that Elena can start her journey from S to arrive at T by 9 pm .
- Hence write down the route that Elena should take.