Call the collection of the following steps of the ford-fulkerson algorithm an iteration of the algorithm
a) from the current flow, the residual network is constructed;
b) a path p from s to t in the residual network is found;
c) the original flow is augmented along p.
as in class, at a given iteration let e be the minimum capacity of the arcs of a path from s to t in the residual network. instead of augmenting by e as seen in class, suppose that at each iteration you augment by e/2. how many iterations does the ford and fulkerson algorithm performs before finding the optimal solution?