SOLVE IT CORRECTLY Use OpenMP to implement a producer$-$consumer program in which some of the threads

are producers and others are consumers. The producers read text from a collection of

files, one per producer. They insert lines of text into a single shared queue. The

consumers take the lines of text and tokenize them. Tokens are $$words$,$ separated by

white space. When a consumer finds a token, it writes it to stdout.

It is advisable to use a prepared word bank or generate words at random and fill the

producer file with them. Keep in mind that for this model, both the producer and

consumer are limited by the size of the buffer $($add a specific limit to it$).$

b$.$ Proceed to carry out the same process using MPI. Draw comparisons between the two

of them. Which of the two programs runs faster. Which of the two programs generates

more overhead and requires more handling for requirements of correctness. Which

performs better at fixed numbers of threads$/$processes$.$