what is meant by consistency in CAP thereoem? Lets establish a few definitions:

N $=$the number of nodes that store replicas of the data

W $=$ Number of replocas that need to acknowledge the receipt of update before update completes

R $=$ Number of replicas that are contacted when a data object is accessed through a read operation

What type of consistency can be guaranteed in the following scenarios?

$($a$)$ W $+$ R $>$ N

$($b$)$ N$=2,$ W$=2$ and R$=1$

$($c$)$ N$=2,$ W$=1,$ and R $=1$