Below is an algorithm for Bounded Buffer problem. Fill in the table of the values of semaphores.

Shared data

semaphore full, empty, mutex;

Initially:

full $=0,$ empty $=$ n$,$ mutex $=1$

Producer process:

do $\{$

$...$

produce an item in nextp

$...$

wait$($empty$)$;

wait$($mutex$)$;

$...$

add nextp to buffer

$...$

signal$($mutex$)$;

signal$($full$)$;

$\}$ while $(1)$;

Consumer process:

do $\{$

wait$($full$)$

wait$($mutex$)$;

$...$

remove an item from buffer to nextc

$...$

signal$($mutex$)$;

signal$($empty$)$;

$...$

consume the item in nextc

$...$

$\}$ while $(1)$;

events mutex full empty

produce $1$ item

produce $1$ item

produce $1$ item

consume $1$ item

consume $1$ item

produce $1$ item

consume $1$ item

consume $1$ item