Suppose that capacities are in equilibrium in a flow network (for every internal node, the total capacity of incoming edges is equal to the total capacity of outgoing edges). Does the Ford-Fulkerson algorithm ever use a backward edge? Prove that it does or give a counterexample.