1. (6%) The following pseudo-code is a solution to the infinite-buffer producer-consumer problem using semaphores discussed in class, where semaphore S is used to ensure mutual exclusion and the value of semaphore N is equal to the number of items in the shared buffer. Answer the questions following the code. void producer(){ while (true){ produce(); semWait(S); append(); Semaphore N = 0, S = 1; void consumer() { while (true){ semWait(N); semWait(S); take(); semSignal(S); semSignal(N); semSignal(S); consume(); A) Why does the consumer code require the semWait(N) operation? Answer: B) If the operations semSignal(S) and semSignal(N) in the producer code are accidentally reversed, can the consumer program still function properly? Justify your answer. Answer: C) If the operations semWait(N) and semWait(S) in the consumer code are accidentally reversed, will this accident produce a serious fatal flaw? Justify your answer. Answer: