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 $0.$

a$)$ Draw $4$ Gantt charts illustrating the execution of these processes using FCFS$,$ non$-$preemptive SJF$,$ non$-$preemptive priority $($a smaller priority number equals a higher priority$),$ and

Round Robin $($quantum $=2)$ scheduling.