3. For the graph below: 16 a 12 b 20 S 10 4 7 13 d 14 A)Find the maximum flow from s to t using the augmenting path algorithm. Show all of your intermediate residual graphs. B) Find a minimum cut on the graph and exaplain how you used the max flow to find the min cut. C) Find the shortest path from s to all other nodes using Dijkstra's Algorithm.