[Instructions] For the Question A) and B) – please review th…
For the Question A) and B) – please review the solution to the readers-writers problem below. Please label your solutions based upon the letter associated with the highlighted placeholders within the solution table. The questions share similarities with the readers-writers problem that we discussed in class. So we show the solution to the readers-writers problem here for your reference. But pay attention to the differences. Copy-and-paste of the original solution may not work. Reference: solution to the readers-writers problem // Shared data structures semaphore rw_mutex = 1; semaphore mutex = 1; int read_count = 0; Reader process Writer process while(TRUE) { wait(mutex); read_count++; if (read_count == 1) wait(rw_mutex); signal(mutex); // reading wait(mutex); read_count–; if (read_count == 0) signal(rw_mutex); signal(mutex); } while(TRUE){ wait(rw_mutex); //writing signal(rw_mutex); } Dr. Z and Dr. L are collaborating on a document. Develop a solution for synchronizing Dr. Z and Dr. L processes (PZ and PL) so that their concurrent accesses to the document do not mess it up. Question A) Assume PZ and PL both can be reading and writing the document. A process can read regardless of whether the other process is reading or writing. When a process is writing, the other process cannot be writing at the same time. Fill in the placeholders in the algorithm below to complete your solution. Solution Table // A. define your shared data structures here PZ PL while(TRUE) { if (reading) { // process wants to read // B. your code here } elseif (writing) { // process wants to write // C. your code here } } // D. you can skip PL’s code if it is identical to PZ