There are two identical processes being run on a system. Each process does the following:

Executes a CPU burst of 1 sec. Outputs 1 KByte of data

Executes a CPU burst of 1 sec. Outputs 1 KByte of data

Executes a CPU burst of 1 sec. Outputs 1 KByte of data

Executes a CPU burst of 1 sec. Outputs 1 KByte of data

Executes a CPU burst of 1 sec and terminates.

A] If the output device has a data rate of 1KByte/sec, find the turnaround time of each process under: i] FIFO scheduling (non-preemptive) ii] Round Robin scheduling (assume the time quanta is small, and the exact value is not important.)

B] Now we add a output buffer of 10KBytes to the above system. Find the turnaround time of each process under: i] FIFO scheduling (non-preemptive) ii] Round Robin scheduling (assume the time quanta is small, and the exact value is not important.