Find an augmenting path in the following flow network. If there are several of them, choose the one with the maximum flow.
Note: write the names of the nodes in the order they are visited. Separate the vertices with spaces. For example, your answer may look like this: B D E A.