Let $G=(V,E,c,s,t)$ be a given flow network. Using the techniques learned in the course we can conclude the following.

$($If more than one choice is correct, then select the red choice.$)$

a$.$ Given a min$-$cut in $G,$ then in linear time we can compute a max$-$flow in $G.$

b$.$ None of the other choices are correct.

c$.$ Given a max$-$flow in $G,$ then in linear time we can compute a min$-$cut in $G.$

d$.$ More than one of the other choices are correct.

e$.$ Given a flow $f$ and an st$-$cut $(x,\stackrel{}{x})$ in $G,$ then in linear time we can determine whether it is true that $f$ is a max$-$flow and $(x,\stackrel{}{x})$ is a min$-$cut in $G.$