2 A delivery company needs to transport heavy loads from its warehouse to a ferry port. Each of the roads that it can use has a bridge with a maximum weight limit. The directed network below represents the roads that can be used to get from the warehouse to the ferry port. Road junctions are labelled with (stage; state) labels. The weights on the arcs represent weight limits in tonnes.
\includegraphics[max width=\textwidth, alt={}, center]{e879b1f5-edc7-4819-80be-2a90dbf3d451-03_896_1561_468_292}

1. Explain what a maximin route is.
2. Set up a dynamic programming tabulation, working backwards from stage 1, to find the two maximin routes through the network. What is the maximum load that can be transported in one journey from the warehouse to the ferry port?
3. A new road is opened connecting ( \(2 ; 0\) ) and ( \(2 ; 1\) ). There is no bridge on this road so it does not restrict the weight of the load that can be carried. Using the new road, what is the maximum load that can be transported in one journey from the warehouse to the ferry port? State the route that the delivery company should use. (Do not attempt to apply dynamic programming in this part.)