Problem 6. (15 points) Consider the max-flow instance below. Figure 1: An instance of the max-flow problem, with edge capacities shown. Answer the following questions, and show your work for partial credit. a) If the Ford-Fulkerson algorithm initially (for its first augmentation) chooses the path (sv1v3v2v4t) as highlighted in Figure 1, what will be the resulting residual graph after the flow is augmented on that path? b) What is the minimum st cut of the graph in Figure 1 ? Problem 6. (15 points) Consider the max-flow instance below. Figure 1: An instance of the max-flow problem, with edge capacities shown. Answer the following questions, and show your work for partial credit. a) If the Ford-Fulkerson algorithm initially (for its first augmentation) chooses the path (sv1v3v2v4t) as highlighted in Figure 1, what will be the resulting residual graph after the flow is augmented on that path? b) What is the minimum st cut of the graph in Figure 1