Using Cygwin's unix like enviroment complete the below problem

In Section 5.7.1, we presented a semaphore-based solution to the producer - consumer problem using a bounded buffer. In this project, you will design a programming solution to the bounded-buffer problem using the producer and consumer processes shown in Figures 5.9 and 5.10. The solution presented in Section 5.7.1 uses three semaphores: empty and full, which count the number of empty and full slots in the buffer, and mutex, which is a binary (or mutual exclusion) semaphore that protects the actual insertion or removal of items in the buffer. do { .. /* produce an item in next-produced */ wait (empty): wait (mutex): .. /* add next-produced to the buffer */ .. signal (mutex): signal (full): } while (true): The structure of the producer process. do { wait(ful1): wait (mutex): .. /* remove an item from buffer to next consumed */ .. signal (mutex): signal (empty): .. /* consume the item in next_consumed */ .. } while (true): The structure of the consumer process. For this project, you will use standard counting semaphores for empty and full and a mutex lock, rather than a binary semaphore, to represent mutex. The producer and consumer - running as separate threads - will move items to and from a buffer that is synchronized with the empty, full, and mutex structures. You can solve this problem using PthreadS