+0.5+3=5] The readers-writers problem has several variations, all involving priorities. The simplest one, referred to as the first readers-writers problem, requires that no reader be kept waiting unless a writer has already obtained permission to use the shared object. In other words, no reader should wait for other readers to finish simply because a writer is waiting. Considering this explanation, answer the following questions - List down all the data structures that are shared between the reader processes 1. 2. 3. - What type of semaphores are used?(Just write the name) - Write down the structure for the writer-process