Modify Figure algorithm to accommodate n sharable resources instead of one.

Queue for semaphore lock semaphore lock Value of 1 Critical region Normal execution 11 ? sunWaidoski I Blocked on semWait(lock) --emaphore I lock semWaitlock) 1 ?? semSignal(lock) TETTT1 - semSignal(lock) semSignallock Note that normal execution can proceed in parallel but that critical regions are serialized. Figure 5.7 Processes Accessing Shared Data Protected by a Semaphore simply by initializing the semaphore to the specified value. Thus, at any time, the value of s.count can be interpreted as follows s.count2 0: s.count is the number of processes that can execute semWait (s) without suspension (if no semSignal (s) is executed in the meantime). Such situations will allow semaphores to support synchronization as well as mutual exclusion. s.count