Consider the network shown below. Run the Ford-Fulkerson Algorithm to find the maximum flow in the network. b) List each augmenting path you use along with the amount of flow you push through the path. Calculate the total flow that results at the end of the algorithm and identify a minimum cut in the network whose capacity is equal to the maximum total flow. 15 25 35 b U 25 40 30 10 26 15 f 50 30 15