Study the Bounded_Buffer problem (Section 7.1.1) carefully. Suppose the two wait statements of Figure 6.10 were reversed by the programmer [so that wait(mutex) is executed before wait(empty)]. What will happen when the buffer is full? (Note: The empty semaphore is initialized to buffer_size; the full semaphore is initialized to 0.)

Figure 6.10Solution to the critical-section problem using mutex locks.

while (true) { acquire lock critical section release lock remainder section }