In a particular network G $=($V$,$ E$)$ whose edges have integer capacities ce$,$ we have

already found the maximum flow f from node s to node t$.$ However, we now find out

that one of the capacity values we used was wrong: for edge $($u$,$ v$)$ we used cuv whereas

it should have been cuv $1.$ This is unfortunate because the flow f uses that particular

edge at full capacity: fuv $=$ cuv. We could redo the flow computation from scratch, but

there$$s a faster way.

Show how a new optimal flow can be computed in O$(|$V $|+|$E$|)$ time.