Problem 6 Let's consider the producer-consumer problem with a bounded buffer (below) The size of the buffer is N. There are 3 semaphores: A binary semaphore mutex. . Counting semaphores X and Counting semaphore Y Producer process Consumer process wait( /* produce item p */ (mutex) wait (X) /* remove item c from buffer wait (mutex); /*add p to buffer / signal (mutex) signal ( signal (X); signal (Y) /*consume c */ ) while (true)i ) while (true); c. The initial value of X is N. Other initial values are mutex and Y (specify both) d. Fll in the blanks in the code for the Consumer process