d) The following code tries to solve the critical section problem of Readers and Writers. The condition is such that a reader cannot read while the writer writes the data and vice versa. reader) ( while (TRUE) t writer i while(TRUE Kother computing wait (mutex2) wait (RD) writeCounttti wait (mutexl) if (writeCount 1) readcount++ wait (RD) 1/3 if ( readCount??1 ) signal (mutex2) wait (WRT) wait (WRT signal (mutexl) access { resourc ) ; signal (WRT) wait (mutex2) signal (RD) writeCount-- if (wr i t eCount wait (mutex1) ?) mm r eadCount-- if(readCountO) signal (RD)//4 signal (mutex2): signal (WRT) signal (mutexl); semaphore mut x1=1, mutex2=1; semaphore RD=1.wRT :1 (i) Explain the use of each numbered statement. (2 marks) (ii) Assume that a Reader 1 is reading; Writer 1 is waiting to write and Reader 2 comes. What condition prevents the Reader 2 from reading the data? (1 mark) (iii) Assume that a writer l is writing. What condition prevents the Writer 2 from writing the data? (1 mark) (iv) What is the strategy used by the Readers and Writers in the algorithm? (1 mark)