Q$5.[6$ pts$.]$ CPU Scheduling: The table below lists processes and their associated arrival C$)$ Round$-$Robin $(RR)$ with a quantum $=4,$ and context switch numphond $f_1.$

D$)2-$CPU Round$-$Robin with quantum $=2$ each, with zero context switch overhead and

with processor affinity:

CPU $1$:

$P_1$ wait:

turnaround:

$P_2$ wait:

turnaround:

$P_3$ wait:

turnaround:

$P_4$ wait:

turnaround:

Total average waiting time:

Throughput time:

time at the ready queue along with their CPU burst times.

For each of the following, draw a Gantt chart and show the scheduling order of the

above processes. In addition to the Gantt charts, calculate the total waiting time and

the turn round time for each process, as well as the total average waiting time, and the

throughput time.

Examples of a Gantt chart would be:

$P_1(2),CS(1),P_2(3),$dots

$P_1,P_1,CS,P_2,P_2,P_2,$dots

$(P_1$ runs for $2$ unit time followed by a context switch in $1$ unit time, followed by $P_2$dots $)$

A$)$ First$-$In$-$First$-$Out $($FIFO$),$ with no context switch overhead:

$P_1$ wait:

turnaround:

$P_3$ wait:

turnaround:

$P_2$ wait:

turnaround:

$P_4$ wait:

turnaround:

Total average waiting time:

Throughput time:

B$)$ Shortest$-$Job First $($SJF$),$ with context switch overhead of $1$:

$P_1$ wait:

turnaround:

$P_2$ wait:

turnaround:

$P_3$ wait:

turnaround:

$P_4$ wait:

turnaround:

Total average waiting time:

Throughput time: