Problem C. Solving the Bounded Buffer problem: Multiple Processes are producing and consuming full buffers by adding a newly produced full buffer to the head of a shared array-based list and removing a full buffer to be consumed from the tail of this shared list. a. using the structure given in Slide 3.23 and the algorithm in Slide 3.36, define and initialize a binary semaphore variable named mutex, a semaphore variable named full, and a semaphore variable named empty, using b. re-write the following produce () and consume ) functions to implement the algorithm in Slides 3.36 through 3.38 to solve the racing conditions (Hint: are the use of the variable counter and the while loop still needed?)