Augmenting Paths with the Minimum Number of Backward Arcs. Imagine that, in each iteration, the Ford-Fulkerson algorithm selects the aug- menting path in Gf with the fewest number of backward arcs. Prove that: (a) The total number of iterations is (mn). (b) The total running time is (m?n). Augmenting Paths with the Minimum Number of Backward Arcs. Imagine that, in each iteration, the Ford-Fulkerson algorithm selects the aug- menting path in Gf with the fewest number of backward arcs. Prove that: (a) The total number of iterations is (mn). (b) The total running time is (m?n)