A counting semaphore allows N $(1)$ client processes to enter a critical section at the same time.

Extend our binary semaphore model $($Version $2,$ figure$)$ to a counting semaphore with a general N$,$ where N is given as a parameter upon process creation.

Then, create a counting semaphore with N$=3,$ run it with five client processes wanting to enter critical sections infinitely often, and check that

$1.$ it never lets more than three processes stay in the critical sections simultaneously, and that

$2.$ it may let three processes stay in the critical sections. $$

Note: You may have to change the algorithm of figure