/* program boundedbuffer */ const int sizeofbuffer - /* buffer size */; semaphore s = 1, n= 0, e= sizeofbuffer; void producer() while (true) { produce(); semwait(e); semwait(s); append(); semSignal(s); semSignal(n); void consumer() while (true) { semwait(n); semWait(s); take(); semSignal(s); semSignal(e); consume(); void main() parbegin (producer, consumer); Fig. 1 A solution to the Bounded-Buffer Producer/Consumer Problem Using Semaphore 1. Consider Fig. 1. Would the meaning of the program change if the following were interchanged? (15 points each) a. semWait(e); semWait(s) b. semSignal(s); semSignal(n) c. semWait(n); semWait(s) d. semSignal(s); semSignal(e)