Please solve step by step.

Please do Not copy other answers here at Chegg.

Use the instructed algorithm for each part in the question,

PART (A) augmenting path algorithm showing ALL intermediate residual graphs

PART (B) Find a minimum cut on the graph and explain how you used the max flow to find them min cut,

and PART (C) Find the shortest path from s to all other nodes using Dijkstras Algorithm.

3. For the graph below 12 16 20 10 A 13 4 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