Problem Statement
In a quorum system with N replicas, which condition helps ensure a read sees the latest write?
Explanation
If read quorum R and write quorum W intersect (sum greater than N), at least one replica in the read set has the latest write. That gives strong single-row semantics when paired with versioning.
Code Solution
SolutionRead Only
N=5, W=3, R=3 → 3+3>5 ensures overlap
