Compute-intensive communicating processes. which transfer a total of 100 characters during their operation. Assume that the time-sharing system time-slices between these processes with a 1-S quantum; that is, an alarm-clock interrupt (which invokes the scheduler) occurs once per second. The alarm-clock interrupt request is honored only in user mode, that is, when one of the processes (rather than a kernel handler) is running. If an alarm-clock interrupt request occurs when the kernel is running, response to it is deferred until user mode is reentered. Assuming that all computation times are negligible, estimate the total real time that elapses between invocation of these processes and their completion.

Suggest a one-statement addition to each of the handlers that dramatically reduces the elapsed time you calculated in part C.

If the producer and consumer processes how many characters per second will be transferred, on the average, between these processes?