(c) Use the feasible solution for the network in (b) together with the maximal flow algorithm
to determine the minimal flow in the original network. (Hint: First compute the
residue network given the initial feasible solution. Next, determine the maximum flow
from the end node to the start node. This is equivalent to finding the maximum flow
that should be canceled from the start node to the end node. Now, combining the feasible
and maximal flow solutions yields the minimal flow in the original network.)