Considering a new policy whereby the same bathroom may be used by both men and women. However, at any given time either only women or only men may be using the bathroom. Assume the bathroom has infinite capacity, write these functions: Woman_wants_to_enter
Man_wants_to_enter
Woman_leaves
Man_leaves
Your solution must satisfy the desired invariant stated above and be deadlock-free. It is acceptable for your solution to starve someone. You may use any combination of mutex locks, condition variable, and semaphores. You will get 0 points if your solution makes someone wait when they need not. You may use pseudo-code similar to that used in class; you do not need to use exact data type and function names from the pthreads API. You will win/lose points based on the following components/properties of your solution:
• Choice of synchronization-related variables, how you initialize them, and a succinct comment next to each describing its purpose
• Your use of synchronization-related variables with comments describing the purpose/effect of key statements and conditions .
• Your intent indicated in your comments must match what your pseudo-code accomplishes