Needed help solving this confusing question on the Ford-Fulkerson algorithm on for programming analysis.

3. We will look at how the Ford-Fulkerson Algorithm operates on the following network. Each edge is annotated with the current flow (initially zero) and the edge's capacity. In general, a flow of x along an edge with capacity y is shown as x/y 0/8 0/16 0/5 0/13 0/8 0/2 U3 0/4 0/14 0/12 0/10 0) (a) Show the residual graph that will be created from this network with the given (empty) flow. In drawing a residual graph, to show a forward edge with capacity r and a backward edge with capacity y, annotate the original edge [4 marks] (b) What is the bottleneck edge of the path (s, v1, V3, v5, t) in the residual [2 marks] graph you have given in answer to Question 3a? (c) Show the network with the flow that results from augmenting the flow based on the path (s, v1, V3, v5,t) of the residual graph you have given in answer to Question 3a [3 marks] (d) Show the residual graph for the network flow given in answer to [4 marks] Question 3c. 3. We will look at how the Ford-Fulkerson Algorithm operates on the following network. Each edge is annotated with the current flow (initially zero) and the edge's capacity. In general, a flow of x along an edge with capacity y is shown as x/y 0/8 0/16 0/5 0/13 0/8 0/2 U3 0/4 0/14 0/12 0/10 0) (a) Show the residual graph that will be created from this network with the given (empty) flow. In drawing a residual graph, to show a forward edge with capacity r and a backward edge with capacity y, annotate the original edge [4 marks] (b) What is the bottleneck edge of the path (s, v1, V3, v5, t) in the residual [2 marks] graph you have given in answer to Question 3a? (c) Show the network with the flow that results from augmenting the flow based on the path (s, v1, V3, v5,t) of the residual graph you have given in answer to Question 3a [3 marks] (d) Show the residual graph for the network flow given in answer to [4 marks] Question 3c