Question I: Scheduling Problem $[50$ pts$]$

Consider the following set of processes, with their arrival times, CPU$-$burst lengths, and priorities.

$\backslash$begin$\{$tabular$\}\{|$l$|$l$|$l$|$l$|\}$

$\backslash$hline Process & Arrival Time & Burst Time & $\backslash$begin$\{$tabular$\}\{$l$\}$

Priority $($Lower $\backslash \backslash$

Number $=$Higher $\backslash \backslash$

Priority$)$

$\backslash$end$\{$tabular$\}\backslash \backslash$

$\backslash$hline P$1$ & $0$ & $8$ & $2\backslash \backslash$

$\backslash$hline P$2$ & $1$ & $4$ & $1\backslash \backslash$

$\backslash$hline P$3$ & $2$ & $9$ & $4\backslash \backslash$

$\backslash$hline P$4$ & $3$ & $5$ & $3\backslash \backslash$

$\backslash$hline

$\backslash$end$\{$tabular$\}$

Draw the Gantt chart and compute the average waiting time for the following scheduling algorithms:

a$)$ First Come First Served $($FCFS$)$

b$)$ Non preemptive Shortest Job First $($SJF$)$

c$)$ Preemptive Shortest Job First $($SJF$)$

d$)$ Non preemptive Priority scheduling where $1$ is the highest priority

e$)$ Preemptive Priority scheduling where $1$ is the highest priority

$\backslash$begin$\{$tabular$\}\{|$l$|$l$|$l$|$l$|$l$|$l$|\}$

$\backslash$hline Waiting time & P$1$ & P$2$ & P$3$ & P$4$ & Average $\backslash \backslash$

$\backslash$hline a$.$ FCFS & & & & & $\backslash \backslash$

$\backslash$hline b$.$ Non preemptive. SJF & & & & & $\backslash \backslash$

$\backslash$hline c$.$ Preemptive. SJF & & & & & $\backslash \backslash$

$\backslash$hline $\backslash$begin$\{$tabular$\}\{$l$\}$

d$.$ Non $\backslash \backslash$

Priority preemptive

$\backslash$end$\{$tabular$\}$ & & & & & $\backslash \backslash$

$\backslash$hline e$.$ Preemptive Priority & & & & & $\backslash \backslash$

$\backslash$hline

$\backslash$end$\{$tabular$\}$