Given a flow network G $=($V$,$E$)$ and a flow f$,$ we call f cyclic if there is some cycle C $$ E

with f$($e$)>0$ for all e in C$.$ Design an efficient algorithm that, given a flow network G and flow

f$,$ modifies f to be acyclic without changing its value.