Network flow maximization: $(10$ points$)$: Apply the Network flow maximization

algorithm in the text book $($see Weiss, pages $406-412)$ to the network below one step at a

time. At each step, show diagrams of the flow graph $Gf$ and the residual graph $Gr$ as in

Figs $9\mathrm{.}46$ and $9\mathrm{.}47$ in the text book. Add captions to each diagram to describe how you

obtained it from the previous diagram. In particular, describe the policy used to select an

augmenting path from $s$ to $t$ for adding to the flow graph when multiple options were

available. What is the termination condition for your algorithm? Prove that your solution

is correct.