The readers and writers algorithm using semaphores which we presented in class and is in the text is referred to as solving the first readers writers problem, and favors the readers. Explain how this is so. How would you modify the algorithm to address the second readers writers problem so that the writer could gain access to the shared data ASAP? Do both of these solutions allow starvation? What modification would you propose to the second solution, that favors the writer, to reduce the liability of starvation of readers.