Exercise $2$

Consider the following processes with the corresponding arrival time and burst time.

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

$\backslash$hline Process$-$id & Burst time & Arrival time $\backslash \backslash$

$\backslash$hline $\backslash (\backslash$mathbf$\{$P$\}\_\{\backslash$mathbf$\{1\}\}\backslash )$ & $6$ & $2\backslash \backslash$

$\backslash$hline $\backslash (\backslash$mathbf$\{$P$\}\_\{\backslash$mathbf$\{2\}\}\backslash )$ & $2$ & $5\backslash \backslash$

$\backslash$hline $\backslash (\backslash$mathbf$\{$P$\}\_\{\backslash$mathbf$\{3\}\}\backslash )$ & $8$ & $1\backslash \backslash$

$\backslash$hline $\backslash (\backslash$mathbf$\{$P$\}\_\{\backslash$mathbf$\{4\}\}\backslash )$ & $3$ & $0\backslash \backslash$

$\backslash$hline $\backslash (\backslash$mathbf$\{$P$\}\_\{\backslash$mathbf$\{5\}\}\backslash )$ & $4$ & $4\backslash \backslash$

$\backslash$hline

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

Q$1-$ Draw the corresponding Gantt Chart of applying SRTF scheduling algorithms on this set of processes.