Problem Three

A $-$ Consider the following set of processes:

$\backslash$table$[[$Task$,$Arrival Time,Processing Time$],[$A$,0,2],[$B$,1,4],[$C$,4,2],[$D$,4,1],[$E$,5,3]]$

$1-$ Draw a timeline diagram showing how these processes would be scheduled using Highest Response Ration Next $($HRRN$)$ scheduler. $[2$ points$]$

$2-$ Draw atimeline diagram showing how these processes would be scheduled using Round$-$Robin scheduler with quantum $=2.[2$ points$]$

$2-$ Draw a timeline diagram showing how these processes would be scheduled using Shortest Remaining Time First $($SRTF$)$ scheduler. $[2$ points$]$