Operating Systems.

Consider a system running 11I/O-bound processes and 4CPU-bound processes. Assume that the I/O-bound processes issue an 1/O operation once for every millisecond of CPU computing and that each 1/O operation takes 10 milliseconds to complete (we assume that there is no competition among I/O operations). Assume that the CPU-bound processes do not issue any 1/O operations. A roundrobin scheduler with quantum size 3 milliseconds is used to schedule all these (11+4) processes together. We assume that the context-switching overhead is 0.1 millisecond and that all processes are long-running tasks. Calculate the CPU utilization (keep three decimal values)