Question#3 (5 marks) Assume the following particular conditions/circumstances: A system has only 3 critical and only 6 processes actually share these critical sections. There are exactly 6 routines where one or more of these critical sections are being accessed. If more than one method, then the order of appearance is undetermined (that is, they can appear on any order). Further, we are only interested in achieving mutual exclusion (MM good progress. Is it possible under these very particular conditions sections (C.S.), E.) and deadlock-free. We are not interested in to implement a monitor as follows: All 6 routines are implemented as part of the monitor - 3 hidden semaphores (say mtex, mutex and mutexs) are used, one for each of the critical sections - At the start of each method, P(mutex) is automatically injected if the C.S. for that semaphore appears in the method (which is easy to detect). At the end of the method, V/mute%) is automatically injected to release the semaphores obtained at the start of the method. ad ular conditions, is it possible to implement such a monitor to allow for high- level synchronization. If yes, explain clearly why this implementation is solid (reliable) in achieving what is needed. Ifno, show clearly how thisimplementation will fail. erM ut. a