Quiz: Max-Flow Min-Cut Relationship

You compute max flow on a network and get value $12$. You find an $s$-$t$ cut with $3$ edges of capacities $5$, $4$, and $3$. What can you conclude?

1. A.The cut is not minimal because $5 + 4 + 3 = 12$ is coincidental
2. B.This confirms the max-flow min-cut theorem: the cut capacity equals the max flow
3. C.The max flow should be $3$ because that is the bottleneck edge
4. D.You must check all other cuts before concluding anything