Quiz: Max-Flow Min-Cut Theorem

You compute max flow and get value $15$. You find the min-cut by running BFS on the residual graph from $s$. Which edges form the min-cut?

1. A.All edges from $s$ to its neighbors
2. B.All edges where both endpoints are reachable from $s$ in the residual graph
3. C.All original-graph edges from BFS-reachable nodes to non-reachable nodes
4. D.All edges with zero residual capacity