Question$2$: Consider the following table of arrival time and burst time for these processes:

$\backslash$table$[[$Process$,$Arrival Time,Burst Time,Priority$],[$P$1,0,8,2],[$P$2,7,10,4],[$P$3,5,4,3],[$P$4,8,5,4],[$P$5,2,3,1]]$

Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS$,$ SJF$,$ a preemptive priority $($a smaller priority number implies a higher priority$),$ and RR $($quantum $=5).$

What is the waiting time of each process for each of the scheduling algorithms in part $1?$

What is the average waiting time of each process for each of the scheduling algorithms in part $1?$