algorthimd

3. Max-flow and Min-cut. (20 points) You are given the following flow graph G = (V, E, s,t) with the indicated edge capacities. 9 12 20 3 9 6 5 U5 2 11 7 4 14 04 a.) (15 points) Use the Ford-Fulkerson algorithm to find the maximum flow for graph G. In every iteration, show the residual network, the augmented path you chose, and the updated flows, b) (5 points) Determine the cut (by specifying the edges in the cut) with capacity equal to the maximum flow you found in part (a). Explain why this is the minimum cut