Consider the network shown in the diagram below. Using the generic Ford rson Algorithm determine the maximum flow in the network. Do not just write the final answer. Show the original network (with low) and residual graph (with selected augmenting path highlighted) alternately for each iteration. Don't be lazy and draw the graphs afresh min-cut as well (as a byproduct). (12 Pts.) every time. Determine a 6