9.
\includegraphics[max width=\textwidth, alt={}, center]{343fdcef-660e-4e8c-bd9c-a7f929dc668e-6_1088_1509_219_285} The diagram above shows a network of roads represented by arcs. The capacity of the road represented by that arc is shown on each arc. The numbers in circles represent a possible flow of 26 from \(B\) to \(L\). Three cuts \(\mathrm { C } _ { 1 } , \mathrm { C } _ { 2 }\) and \(\mathrm { C } _ { 3 }\) are shown on The diagram above.

1. Find the capacity of each of the three cuts.
2. Verify that the flow of 26 is maximal. The government aims to maximise the possible flow from \(B\) to \(L\) by using one of two options.
   Option 1: Build a new road from \(E\) to \(J\) with capacity 5.
   or
   Option 2: Build a new road from \(F\) to \(H\) with capacity 3.
3. By considering both options, explain which one meets the government's aim