5 [Figure 3, printed on the insert, is provided for use in this question.]
The following network shows 11 vertices. The number on each edge is the cost of travelling between the corresponding vertices. A negative number indicates a reduction by the amount shown.
\includegraphics[max width=\textwidth, alt={}, center]{68ff5b50-6aff-4b28-8fad-d16a8bb4779e-05_824_1504_559_278}

1. Working backwards from \(\boldsymbol { T }\), use dynamic programming to find the minimum cost of travelling from \(S\) to \(T\). You may wish to complete the table on Figure 3 as your solution.
2. State the minimum cost and the routes corresponding to this minimum cost.