Let C > 0 be an integer and let G be a directed weighted graph such that w(e) = for each e E(G). Provide an algorithm in polynomial time to find a flow of size C which minimizes max f(e) where e E(G).