onsider a simpler variant of the readers-writers problem where there are at most n readers. derive a solution that gives equal priority to readers and writers, in the sense that pending readers and writers have an equal chance of being granted access to the resource. hint: you can solve this problem using a single counting semaphore and a single mutex. [15 points]