Please help. Modify algorithm to accommodate 'n' shareable resources instead of one.

/*program mutualexclusion */ const int n-/* number of processes/ semaphore s = 1; void P(int i) while (true) ( semWait(s); /* critical section */ semSignal(s); /* remainder void main() parbegin (P(1), P(2), . . ., P(n))i /*program mutualexclusion */ const int n-/* number of processes/ semaphore s = 1; void P(int i) while (true) ( semWait(s); /* critical section */ semSignal(s); /* remainder void main() parbegin (P(1), P(2), . . ., P(n))i