a) Use the Ford-Fulkerson Algorithm to find a flow function that maximizes the flow in the below network having the capacities shown and calculate the total flow that results. List the augmenting paths that you use to get your solution in order to get full credit. b) Show a minimum cut in the network whose capacity is equal to the maximum flow you found in a). 50 a 50 2% 10 35 20 15 15 20 20 la 10