The bounded-buffer problems (the producer-consumer problem) is a classic example of concurrent access to a shared resource. A bounded buffer lets multiple producers and multiple consumers share a single buffer. Producers write data to the buffer and consumers read data from the buffer.
- Producers must block if the buffer is full.
- Consumers must block if the buffer is empty.
Hence option A is correct