You are given a flow network with unit-capacity edges: It consistsofadirectedgraphG=(V,E),asources?V,andasinkt?V;andce =1forevery e ? E. You are also given a parameter k. The goal is to delete k edges so as to reduce the maximum s?t flow in G by as much as possible. In other words, you should find a set of edges F ? E so that |F| = k and the maximum s?t flow in G = (V,E \F) is as small as possible subject to this. Give a polynomial-time algorithm to solve this problem.