consider a flow network G $=($V$,$ E$,$ s$,$ t$,$ c$)$ where the capacity of every edge is $1$ and the shortest$-$path distance from s to t is at least d$.$ Which of the following gives a correct bound on the value of the maximum $($s$,$t $)-$flow on G$?$ Hint: It is straightforward to think of a counter$-$example for each incorrect answer.

It is at least E$-$d$.$

It is at most $($E$)/($d$).$

It is at least E$.$