How many type of reader and writer problems?  use semaphores to solve these problems , and explain them in detail.

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,