Given a flow network N in which all of the edges have capacity equal to one, and given also an integer k, the problem is to delete k of the edges from N so as to reduce the maximum flow in N by as much as possible.

Give an efficient algorithm to solve this problem.