• 
  

(a) (5 points) Write the pseudo-code of Ford-Fulkerson. Specifically include the pseudo-code of the function increaseFlow(path P in Gf, flow f). It is ok to use BFS to find a path from s to t in the residual network. (b) (10 points) For the following graph, show step-by-step the how Ford-Fulkerson finds the max flow/min cut between s and t. At each iteration, show the graph of the flow and the residual network. (Hint: there should be four (4) iterations to find the optimal solution) s 4 6 2 6 3 3 10 3 4 4 4