Consider an algorithm that tries to find a maximum flow by repeatedly finding a path with leftover capacity in a given flow network G, and augmenting the current flow by sending as much flow as it can along this path. The algorithm terminates when it cannot find any further paths from s to t. Such an algorithm will (pick one of the following) 1) Find the max flow, but may run for a number of iterations that depend on the value of the max flow.
2) Will not always find the maximum flow but will run efficiently
3) Find the max flow in a number of iterations that doesn't depend on the value of the max flow
4) Will not always find the max flow and may run for a number of iterations that depends on the value of the max flow.