We studied several classic synchronization problems this semester. Two versions of the Readers-Writers problems where we prioritized readers in the first leading to potential starvation of writers and one prioritizing writers that could lead to starvation of readers. One solution to the starvation problem would be to program the rules below:

A reader can enter (with other readers) the Critical Section only when no writer is waiting. When the last reader exits the Critical Section, a waiting writer enters.

All readers that have arrived while a writer is in the Critical Section must be allowed to enter before the next writer enters. (Once the writer exits, see rule 1).

Modify the 2^nd Readers-Writers Problem code below to implement these rules