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

$\backslash$table$[[$Process$,$Arrival time,Burst time$],[$P$1,0,30],[$P$2,5,20],[$P$3,10,10],[$P$4,70,40],[$P$5,70,30]]$

a$)$ Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms

First$-$ Come, First$-$Served $($FCFS$)$ Scheduling

Shortest$-$Job$-$First $($SJF$)$ Scheduling

$,RR($quantum $=10)$

Multiple level with $3$ Queues:

$Q1$: RR with quantum $10$

Q$2$: RR with quantum $20$

Q$3$: FCFS

b$)$ What is the turnaround time and response time of each process for each of the scheduling algorithms in part a$?$

c$)$ Calculate the average waiting time for the first three algorithms