Consider the flow network shown below (reformatted from Textbook Figure 7.26). Run the Ford-Fulkerson algorithm to find the maximum flow and a minimum cut. Show the results of running the algorithm as (1) a list of pairs of the augmentation path found (e.g., s x y t) and the flow amount augmented during the algorithm execution, (2) the final (i.e., maximum) flow value in the flow network and also the calculated max flow value and the min cut capacity additionally, draw a straight line showing the minimum cut across the flow network, and (3) the final residual graph with all the final residual capacities shown on the edges.

10 10 (Edge capacities are show in bold face.) 10