Q$1.$ Scheduling Algorithm Problem

$(5$ Marks$)$

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

$\backslash$table$[[$Process$,$Burst Time,Priority$],[$P$1,$I$0,3],[$P$2,1,1],[$P$3,2,3],[$P$4,1,4]]$

a$)$ Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS$,$ SJF Non Preemptive, SJF Preemptive, Priority and Round$-$Robin $($quantum$=1).$

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

c$)$ Which of the algorithms produce results in the minimum average waiting time $($over all processes$)?$