Please write a full answer and explain well. Do not answer it if you do not know it!

Consider processes that are described using the following notation: arr(t): Process arrives at time t. (Assume that newly arrived processes are appended to the tail of the ready queue.) The arrival itself does not consume any CPU time cpu(d): Process performs a CPU burst of d time units duration cpu_io(dcpu, dio): Process performs first a CPU burst of depu time units duration. This CPU burst is followed by an I/O request that takes dio time units to be serviced by the I/O device (i.e. the process is blocked until the I/O is completed). Only one I/O request (i.e. the one at the head of the waiting queue) can be processed at a time.1 No CPU time is needed for the actual I/O processing. If a process gets unblocked, it is appended at the tail of the ready queue. term: Process terminates. The termination itself does not consume any CPU time The processes Pi - P3 execute the following sequence of activities: P: a(0), cpu io(1,2), cpu_io(2,3), cpu(5), term P2: arT(2), cpu io(5,2), cpu(1), term Ps: arr(4), cpu_io(1,1), cpu(2), term Pi to P3 shall now be scheduled on a single-processor/single core system using Round Robin with a time quantum of 4 time units 1. What is the contents of the ready queue and the waiting queue- and what is the currently running process at each point in time when a change occurs? Present the results in a table like this Time Time spanRunning Ready queue (leftmost element-head,(leftmost element-head, tail towards right) Waiting queue tail towards right) 0 0..1 1..2 2..3 2 2. What is the average residence time? For simplicity, assume that just one I/O device and hence just one waiting queue exists. In case multiple I/O requests are pending in the waiting queue, these are serviced in FIFO (First-in, First-out) order. I/O requests for the same device cannot be serviced in parallel, but have to wait if the I/O device is currently busy) The left end of a queue is supposed to contain the oldest entry and the right end the latest entry. Furthermore, take care to distinguish ready processes from the currently running process - in particular, the currently running process is never in the ready queue or in the waiting queue