Let G = (V, E) be a flow network with integer capacities. Let e be an edge in E, and let G' be a flow network that is the same as G except that the capacity of edge e is one lower in G' than in G. Design and analyze an O(|E| + |V|)-time algorithm that takes as input an integer maximum flow f in G, and computes an integer maximum flow f' in G'.