Design two programs, one for the reader process and the other for the writer process for the following mult?ple readers and wmters problem using binary semaphores (no counting semaphore is allowed in your design) There is a shared memory in a computer (as shown in the figure below) . Multiple readers should be allowed simultaneous accesses to the shared memory Each writer must exclusively access the shared memory (when a writer is accessing the shared memory, no other writer or reader can access the shared memory at the same time) There should not be any starvation problem for either readers or writers. You should not assume any particular number of readers and writers. . You should not assume any particular access patterns by writers and readers. .You can use multiple binary semaphores in your programs. You can use two operations for each semaphore: wait and signal. Please clarify to which semaphore you are performing an operation, such as "wait (S1)" if you are performing wait operation to semaphore SI (same to signal operation). You can use global variables . Answer this question using the form shown in the next page. If the space is not enough, you can write the same form in another sheet of paper, but please follow the style of the form. W WRITE READ Shared Memory T