Any counting semaphore can be implemented using only binary (ie., "mutex semaphore") semaphore(s) and shared memory. Implement a counting semaphore usine only binary semaphorefs) and shared memory Assumptions and requirement: No busy wait (no busy wait) should be used in your implementation. More than one binary semaphore can be used (each binary semaphore must be initialized by"1") Deadlock should mot happern. .Deadlock should not happen. Starvation should not happen. .As a counting semaphore would do, only the first Nprocesses should be let in. Implement wait and signal operations for a counting semaphore. Assume it is your responsibility to make your idea clearly presented in your solution (Fujinoki will not be able to give credit to what you do not present in your solution)