Answer following questions, cribe the Producer/Consumer problem. (3 points a) Describe the h) Describe semaphores. (2 points) ducer consumer problem: ( point for each Complete the following code for solving infinite-buffer producer/consumer cell) semaphore n = 0, s = 1; void consumer() { void producer() { while (true) { while (true) { semwait(n); produce(): take); append(); consume(); void main() { parbegin(producer, consumer); where the definition of semaphores is: struct semaphore { int count; queue Type queue; void semsignal (semaphore s) { s.count++; if (s.count