Consider the following code snippet:

#define MACHINE$\_$CAPACITY $64$

sem$\_$t mutex, slots$\_$filled, slots$\_$empty;

struct machine$\{$ int nitems; $\}$;

double $\_$sleep$\_$time$()\{$ return $2*(($double$)$ rand$()/($double$)$ RAND$\_$MAX$)$; $\}$

void $*$producer$\_$fn$($void $*$args$)\{$

int cokes;

struct machine $*$cur$\_$machine $=($struct machine $*)$ args;

while $(1)\{$

sem$\_$wait$($&slots$\_$empty$)$;

sem$\_$wait$($&mutex$)$;

cokes $=$ cur$\_$machine$->$nitems;

cur$\_$machine$->$nitems $+=1$;

printf$("[$Producer$]$ enqueue cokes $\%$d $->\%$d

$",$ cokes, cur$\_$machine$->$nitems$)$;

sem$\_$post$($&mutex$)$;

sem$\_$post$($&slots$\_$filled$)$;

sleep$(\_$sleep$\_$time$())$;

$\}$

$\}$

void $*$consumer$\_$fn$($void $*$args$)\{$

int cokes;

struct machine $*$cur$\_$machine $=($struct machine $*)$ args;

while $(1)\{$

sem$\_$wait$($&slots$\_$filled$)$;

sem$\_$wait$($&mutex$)$;

cokes $=$ cur$\_$machine$->$nitems;

cur$\_$machine$->$nitems $-=1$;

printf$("[$Consumer$]$ dequeue cokes $\%$d $->\%$d

$",$ cokes, cur$\_$machine$->$nitems$)$;

sem$\_$post$($&mutex$)$;

sem$\_$post$($&slots$\_$empty$)$;

sleep$(\_$sleep$\_$time$())$;

$\}$

$\}$

int main$($void$)\{$

struct machine coke$\_$machine $=\{.$nitems $=0\}$;

srand $($time$($NULL$))$;

sem$\_$init$($&mutex, $0,1)$;

sem$\_$init$($&slots$\_$empty, $0,$ MACHINE$\_$CAPACITY$)$;

sem$\_$init$($&slots$\_$filled, $0,0)$;

pthread$\_$t producer, consumer;

pthread$\_$create$($&producer, NULL, producer$\_$fn$,($void $*)$&coke$\_$machine$)$;

pthread$\_$create$($&consumer, NULL, consumer$\_$fn$,($void $*)$&coke$\_$machine$)$;

pthread$\_$join$($producer$,$ NULL$)$;

pthread$\_$join$($consumer$,$ NULL$)$;

return $0$; $//$ code only reaches here if the machine is broken

$\}$

Which of the following statements is false?

Group of answer choices

Removing slots$\_$filled and slots$\_$empty semaphores causes the data$-$race problem

In the producer$\_$fn$,$ swapping sem$\_$post$($&slots$\_$filled$)$ and sem$\_$post$($&mutex$)$ code lines causes deadlock.

In the producer$\_$fn$,$ swapping sem$\_$wait$($&mutex$)$ and sem$\_$wait$($&slots$\_$empty$)$ code lines can cause deadlock problem.

This code runs without data$-$race or deadlock problems

Removing mutex semaphore causes the data$-$race problem