You are given a flow network G with source s, sink t and unit-edge capacities, i.e., c(u, v)1 for any (u, ) E E. You are also given a parameter k. We want to delete k edges from G so as to reduce the max flow in as much as possible. In other words, you should find a set of edges C E such that F-k and the maximum flow in G, (V. E F) is as small as possible. Give a polynomial time algorithm to solve this problem. Analyze the time complexity of your solution. You are given a flow network G with source s, sink t and unit-edge capacities, i.e., c(u, v)1 for any (u, ) E E. You are also given a parameter k. We want to delete k edges from G so as to reduce the max flow in as much as possible. In other words, you should find a set of edges C E such that F-k and the maximum flow in G, (V. E F) is as small as possible. Give a polynomial time algorithm to solve this problem. Analyze the time complexity of your solution