Consider the following set of processes, with the length of the CPU burst time

given in milliseconds:

The processes are assumed to have arrived in the order P$1,$ P$2,$ P$3,$ P$4,$ P$5,$ all at time

a$.$ Draw four Gantt charts that illustrate the execution of these processes using the

following scheduling algorithms: FCFS$,$ SJF$,$ nonpreemptive priority $($a smaller

priority number implies a higher priority$),$ and RR $($quantum $=2).$

b$.$ What is the turnaround time of each process for each of the scheduling algorithms

in part a$?$

c$.$ What is the waiting time of each process for each of these scheduling algorithms? The processes are assumed to have arrived in the order P$1,$ P$2,$ P$3,$ P$4,$ P$5,$ all at time

$0.$

a$.$ Draw four Gantt charts that illustrate the execution of these processes using the

following scheduling algorithms: FCFS$,$ SJF$,$ nonpreemptive priority $($a smaller

priority number implies a higher priority$),$ and RR $($quantum $=2).$

b$.$ What is the turnaround time of each process for each of the scheduling algorithms

in part a$?$

c$.$ What is the waiting time of each process for each of these scheduling algorithms?

Which of the algorithms results in the minimum average waiting time $($over all

processes$)?$

$**$For question $($b$)$ and $($c$)$ Please organize your answers in tables example:$2.$ Consider the following set of processes, with the length of the CPU burst time

given in milliseconds:

Process Burst Time Priority

P$153$

P$224$

P$3101$

P$433$

P$542$

The processes are assumed to have arrived in the order P$1,$ P$2,$ P$3,$ P$4,$ P$5,$ all at time

$0.$

a$.$ Draw four Gantt charts that illustrate the execution of these processes using the

following scheduling algorithms: FCFS$,$ SJF$,$ nonpreemptive priority $($a smaller

priority number implies a higher priority$),$ and RR $($quantum $=2).$

b$.$ What is the turnaround time of each process for each of the scheduling algorithms

in part a$?$

c$.$ What is the waiting time of each process for each of these scheduling algorithms?

Which of the algorithms results in the minimum average waiting time $($over all

processes$)?$

$**$For question $($b$)$ and $($c$)$ Please organize your answers in tables example:

FCFC SJF RR Priority

p$1$

p$2$

p$3$