e processes are assumed to have arrived in the onder PI$,$ P$2,$ P$3,$ P$4,$ P$5$ all at time $0.$

a$.(3$Marks$)$ Draw thice Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS and quantum $=1).$

b$.(3$Marks$)$ what is the turnaround time of each process for each of the scheduling algorithms in part a$?$

c$.(3$Marks$)$ what is the waiting time of each process for each of these scheduling algorithms?

d$.(1$ Mark$)$ Which of the algorithms results in the minimum average waiting time $($over all processes$)?$