. Execute step-by-step the max flow algorithm to find a maximum flow from s to t in the following graph with the given edge capacities:

For each augmentation you must show:

(a) The flow graph

(b) The residual graph

(c) The augmenting path.

9-7-40 b) 0--6--0 f 8 e 6 3