In the previous Programming Project, you have implemented a Producer$-$Consumer

with bounded buffer. However, there was a race condition problem. In this assignment,

you are going to implement a solution for the Producer$-$Consumer problem using

semaphores in C$.$ The program will have the following features:

$1.$ Producer: Generates random integers between $1$ and $100$ and adds them to a

bounded buffer.

$2.$ Consumer: Retrieves integers from the buffer and processes them $($prints to the

console$).$

$3.$ Bounded Buffer: A fixed$-$size buffer shared between the producer and

consumer.

$4.$ Semaphores:

$$ Use one semaphore to count the number of available slots in the buffer.

$$ Use another semaphore to count the number of filled slots.

$$ Use a mutex semaphore to ensure mutual exclusion while accessing the

buffer.

Hint: Your may use your previous code but consider the following

$$ Use sem$\_$init, sem$\_$wait, and sem$\_$post for semaphore operations.

$$ Use pthread$\_$create and pthread$\_$join for thread management.

$$ Include delays $($sleep or usleep$)$ to simulate real$-$world processing time.