Q$3.$ 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 $P1,P2,P3$

P$4,$ P$5.$ Process P$1,$ P$2,$ and P$3,$ arrived at time $0,$ and P$4$ and P$5$ at time $1.$

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

processes using the following scheduling algorithms: FCFS$,$ SJF$,$

non$-$preemptive priority $($a larger 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?

d$.$ Which of the algorithms results in the minimum average waiting

time $($over all processes$)?$

THEY DONT ALL ARIVE AT TIME $0$ AS THE PICTURE SAYS, P$1,$ P$2,$ P$3$ ARRIVE AT TIME $0$ AND P$4,$ P$5$ ARRIVE AT TIME $1.$