Answer-Max-Flow Min-Cut theorem states:

In a flow network, the value of max flow equals min capacity cut.

Question

Max-Flow Min-Cut theorem states:

A Max flow ≥ min cut

B Max flow = min cut

C Max flow ≤ min cut

D Max flow unrelated to min cut

E Max flow = edges