In the problem of Example 3, suppose that in breadth-first search, vertex 4 is labeled first, before vertex 2 , so that vertex 3 will be labeled by vertex 4 rather than vertex 2 . Carry out the maximal flow algorithm by hand and note where a reverse edge arises in the algorithm.