The network below shows the one-way paths between the entrance, \(A\), and the exit, \(H\), of a children's maze.

The vertices represent the intersections of the one-way paths.

The number on each edge is the maximum number of children who are allowed to travel along that path per minute.
 

Question 39

Cuts on this network are used to consider the possible flow of children through the maze. The capacity of the minimum cut would be

1. 20
2. 23
3. 24
4. 29
5. 30

 
Question 40

One path in the maze is to be changed.

Which one of these five changes would lead to the largest increase in flow from entrance to exit?

1. increasing the capacity of flow along the edge \(C E\) to 12
2. increasing the capacity of flow along the edge \(FH\) to 14
3. increasing the capacity of flow along the edge \(GH\) to 16
4. reversing the direction of flow along the edge \(C F\)
5. reversing the direction of flow along the edge \(G F\)