Consider the procedure below for the *Producer-Consumer* problem which uses semaphores:semaphore n = 0; semaphore s = 1; void producer() { while(true) { produce(); semWait(s); addToBuffer(); semSignal(s); semSignal(n); } } void consumer() { while(true) { semWait(s); semWait(n); removeFromBuffer(); semSignal(s); consume(); } }Which one of the following is TRUE?

Let us trace what happens when the consumer runs first while the buffer is empty:

1. Initial values: $s = 1$, $n = 0$.

2. The consumer executes semWait(s). Since $s = 1$, $s$ becomes $0$ and the consumer proceeds.

3. The consumer then executes semWait(n). Since $n = 0$, the consumer is blocked waiting for $n$ to become positive.

4. Now, the producer tries to produce an item. It executes produce() and then semWait(s).

5. Since $s = 0$ (held by the blocked consumer), the producer is also blocked waiting for $s$.

6. Both processes are waiting on each other and neither can proceed: the consumer holds $s$ and waits for $n$, while the producer holds nothing, waits for $s$, and is the only entity that can signal $n$.

Thus, a deadlock occurs if the consumer acquires semaphore s when the buffer is empty. Hence, option (C) is the correct statement.