Now suppose all edges have unit capacity and you are given a parameter k. the goal is to delete k edges so as to reduce the maximum s t flow in g as much as possible. in other words, you should find a set of edges f e so that jfj = k and the maximum s t flow in g0 = (v, e f) is as small as possible subject to this. describe and analyze a polynomial-time algorithm to solve this problem.