A flow F is given in the network below (capacities and ow values are indicated on the edges). Find an F-augmenting s-t path using BFS (show your queue) and augment the flow along this path. Repeat this process until you find a maximum flow and a minimum s-t cut to certify that your solution is optimal.

\f