First readers-writers problem

Suppose we have a shared memory area with the basic constraints detailed above. It is possible to protect the shared data behind a mutual exclusion mutex, in which case no two threads can access the data at the same time. However, this solution is suboptimal, because it is possible that a reader R₁ might have the lock, and then another reader R₂ requests access. It would be foolish for R₂