Hint for question 3

Your algorithm will receive as input the flow f and the modified flow network G = (V,E). Show how to increase f, if needed, to get a maximum flow for the modified network. Use some of the max flow algorithms that we discussed in class, but remember that initially the flow is not zero.

Use the Max Flow Min Cut Theorem to show that your algorithm correctly computes a maximum flow.