The program must use these $2$ threads to communicate with each other using a Producer$-$Consumer approach.

The producer loop: $($w$/$ condition variable$)$

while $(1)$

$\{$

pthread$\_$mutex$\_$lock$($&mutex$)$; $//$ Lock the mutex before checking if the buffer has data

while $($count $==$ SIZE$)//$ Buffer is full; Wait for signal that space is available

pthread$\_$cond$\_$wait$($&space$\_$available, &mutex$)$;

put$\_$item$($value$)$; $//$ Space is free, add an item! This will increment int count

pthread$\_$mutex$\_$unlock$($&mutex$)$; $//$ Unlock the mutex

pthread$\_$cond$\_$signal$($&has$\_$data$)$; $//$ Signal consumer that the buffer is no longer empty

$\}$

The consumer loop: $($w$/$ condition variable$)$

while $(1)$

$\{$

pthread$\_$mutex$\_$lock$($&mutex$)$; $//$ Lock the mutex before checking if the buffer has data

while $($count $==0)//$ Buffer is empty. Wait for signal that the buffer has data

pthread$\_$cond$\_$wait$($&has$\_$data, &mutex$)$;

value $=$ get$\_$item$()$; $//$ There's an item, get it$!$ This will decrement int count

pthread$\_$mutex$\_$unlock$($&mutex$)$; $//$ Unlock the mutex

pthread$\_$cond$\_$signal$($&space$\_$available$)$; $//$ Signal that the buffer has space

$\}$

Both threads must share one mutex and two condition variables to control and protect the counting of a number. The number must count from a starting value of $0$ to $10,$ by ones, at which point the program will end.

You get to decide which parts of the incrementation and printing go in each thread.

Your variables must be named as follows:

Your mutex must be named "myMutex".

Your two conditions variables must be named "myCond$1"$ and "myCond$2".$

Your counting variable must be named "myCount".