You are given a flow network with unit$-$capacity edges: it consists of a directed graph G$=($V$,$E$),$

a source s in V$,$ a sink t in V$,$ and ce$=1$ for all e in E$.$ You are also given an integer k$.$ Your goal is to delete k edges in order 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. Give a polynomial$-$time algorithm to solve this problem