Don't copy
Asap
Extracted text: (Maximum Flow) Jonsider the network flow problem with the following edge capacities, c(u, v) for edge (u, v): c(s,2) = 2, c(s, 3) = 13, c(2, 5) = 12, c(2, 4) = 10, c(3, 4) = 5, c(3, 7) = 6, c(4, 5) = 1, c(4, 6) = 1, c(6,5) = 2, c(6, 7) = 3, c(5, t) = 6, c(7, t) = 2. (a) Draw the network. Only edges with positive capacities are needed. (b) Run the Ford-Fulkerson algorithm to find the maximum flow. Show the residual graph after each augmentation following the convention in the lecture notes to draw the residual graph. Draw only edges with positive capacities for the residual graphs. (c) Show the minimum cut.