Consider the minimum cost flow problem shown in Figure $2\mathrm{.}28.$ Suppose that arcsFigure $2\mathrm{.}28$ Network example.

$(1,2)$ and $(3,5)$ have lower bounds equal to t$\_12=$ t$\_35=5.$ Transform this problem to

one where all arcs have zero lower bounds.