Prove that for any flow-network G, there exists a sequence of O(El) augmentations that causes [10] the Ford-Fulkerson algorithm to terminate with a maximum flow. Prove that for any flow-network G, there exists a sequence of O(El) augmentations that causes [10] the Ford-Fulkerson algorithm to terminate with a maximum flow