Will be solving the producer-consumerproblem with a bounded buffer.
1. The Bounded Buffer ([login to view URL]): This buffer is a first-in first-out (FIFO) circular buffer. There
should be exactly one instance of the buffer. The producers and consumers must reference the
same buffer.
2. Producers ([login to view URL]): The producers are responsible forproducing data items to be added
to the buffer. Ifthe bufferis full, the producers must wait forthe consumerto consume at least
one item before it can add a new item to the buffer. The producers are required to produce a
given numberofitems. Theitemthattheproducersadd tothebufferisarandom character(with
valuesbetween Ato Z, in uppercase). There can will be one ormore producerthreadsrunning
at the same time.