Given the flow network above, run the Capacity Scaling Max-Flow algorithm and show the flow in the network G and the residual graph Gf after each iteration of augmentation. Choose an augmenting path with the largest bottleneck if there are multiple possible augmenting paths.

Scaling Max-Flov Initially f(e)=0 for all e in G Initially set ? to be the largest power of 2 that is no larger than the maximum capacity out of s: ?_maxe out ofsCg While ? 1 While there is an s-t path in the graph Gf(A) Let P be a simple s-t path in Gf(A)