In the example of Figure 26.6, what is the minimum cut corresponding to the max- imum flow shown? Of the augmenting paths appearing in the example, which one cancels flow?

12320 4/12 (a) s 4/16( y 14 44/4 V3- 20 4 10 4 4 4 44/4 12 8/12 16 (c) s 4 4 44/4 Figure 26.6 The execution of the basic Ford-Fulkerson algorithm. (a)-(e) Successive iterations of the while loop. The left side of each part shows the residual network Gf from line 3 with a shaded augmenting path p. The right side of each part shows the new flow f that results from augmenting f by fp. The residual network in (a) is the input network (G