Let us say we have N nodes. Read-Write Quorum says that if we write to atleast W nodes and read from atleast R nodes, such that W R>N, then it is guaranteed that whenever the user reads data from R nodes, atleast one node contains the updated data. In the diagram, N = 5, R = W = 3, W R > N