Consider the program constructs and code snippets for the producer and consumer processes which communicate using share memory. Provide answers to the questions which follow. #define BUF_SIZE 10 typedef struct { int x = 4; char grade = 'A'; } item; Consumer Remove() while (true) { while (counter == 0) ; // do nothing // remove an item from the buffer item nextConsumed = buffer[out]; out (out + 1) % BUF_SIZE; counter--; } item buffer[BUF_SIZE]; int in = 0, out = 0, counter = 0; //Function nextProduced() creates a new item. Producer insert() while (true) { /* Produce an item */ while (counter == BUF_SIZE) ; // do nothing (keep looping) buffer[in] =nextProduced(); in = (in + 1) % BUF_SIZE; counter++ } (a) (b) (c) After the processes have executed for some time, it is found that out = 9 and in = 6. How many items are in the buffer? Make a sketch to show the position of the items in the buffer. Justify your answer. When in = out = 5, the buffer is found to be empty. Describe a sequence of events which resulted in this configuration. With reference to the code, explain what happens when in = out = 5, the buffer is empty and it's the consumer's turn to execute.