1. Write a solution to the readers-writers problem using mutual exclusion locks that gives priority to writers. 2. Write a solution to the readers-writers problem using mutual exclusion locks that is...

1. Write a solution to the readers-writers problem using mutual exclusion locks that gives priority to writers.

2. Write a solution to the readers-writers problem using mutual exclusion locks that is fair to both the readers and writers (Hint: use an FCFS discipline in the solution).

3. Implement Example 17 using counting semaphores, allowing at most n simultaneous readers or 1 writer into the database at any time.

4. Figure 12.34 gives a monitor solution for the Dining Philosophers problem. Reimplement the solution using mutual exclusion locks.