Consider the following flow network and initial flow f , Each edge (, ) is labeled by (, ): (, ). We will perform one iteration of the Edmonds–Karp algorithm

(a) Draw the residual network Gf of G with respect to f .
(b) List the vertices in the shortest augmenting path, that is, the augmenting path with the fewest possible edges.
(c) Perform the augmentation. What is the value of the resulting flow?
7:9 10:10 10:10 1:15 7:10 / 2:4 0:15 2:3 7:7 8:9 8:9 a 4:6 11:42 4:6 4:6 0:15 13:15 10:10 24:30 14:30