Consider the following set of processes, with the length of the CPU burst time given in milliseconds:

$\backslash$table$[[$Process$,$Burst Time$],[P_1,2],[P_2,1],[P_3,8],[P_4,4],[P_5,5]]$

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 a Gantt chart that illustrate the execution of these processes using FCFS$,$ and SJF scheduling algorithms.

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?

Consider again the following set of processes, with the length of the CPU burst time given in milliseconds:

$\backslash$table$[[$Process$,$Burst Time,Priority$],[P_1,2,2],[P_2,1,1],[P_3,8,4],[P_4,4,2],[P_5,5,3]]$

Drawa Gantt chart that illustrate the execution of these processes using priority scheduling algorithm $($a larger priority number implies a higher priority$).$