Use PseudoCode/Coarse grained to show answer.

4.16 Atomic Broadcast. Assume one producer process and n consumer processes share a buffer. The producer deposits messages into the buffer, consumers fetch them. Every message deposited by the producer has to be fetched by all n con- sumers before the producer can deposit another message into the buffer. (a) Develop a solution for this problem using semaphores for synchronization