Operating system, process synchronization

Q3 (30): The classical producer/consumer problem with bounded buffer of size Ncan be solved by using semaphore as follows: semaphore mutex=1; Semaphore ful1-0 Semaphore empty N consumer () producer do f do wait (full); wait (mutex) :4 // consume an item from buffer signal (mutex) i signal (empty) wait (empty) wait (mutex) // add the item to the buffer signal (mutex) signal (full) ) while (TRUE) ) while (TRUE): (10 marks) What problems would appear if we invoke wait (mutex)s betore wait (full) (20 marks) Consider a slightly modified version of producer/consumer problem (with bounded buffer). In this case, the producer does not produce any item unless the buffer is completely empty. When puffer is completely empty, the producer fills up the entire buffer. The consumer does not consume any tem unless the buffer is full. When buffer is full consumer consumes all the items. low would you modify the above solution to handle this problem? Please provide a psuedocode similar the above