An algorithm problem

Let G=(V,E,s,t,c) be a flow network with an integer capacity c(e) on each edge eE, and let a maximum flow f on G be given. In other words flow values along each edge ing' for this maximum flow are given to us. Let e=(u,v) be an edge in E. Suppose we increase the capacity of e to c(e)=c(e)+1 while leaving the capaciies of the other edges unchanged.Let us use G to denote thisflow network, which is G with capacity of edge e increased to c(e). Give a linear timealgorithm to update f to a maximum flow and to return a minimum cut in G