Question $1($Mandatory$)(50$ points$)$

Saving...

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

The processes are assumed to have arrived in the order $\backslash (\backslash$mathbf$\{$P$\}1,\backslash$mathbf$\{$P$\}2,\backslash$mathbf$\{$P$\}3,\backslash$mathbf$\{$P$\}4,\backslash$mathbf$\{$P$\}5\backslash ),$ all at time $0.$

a$.$ Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS$,$ SJF$,$ nonpreemptive priority $($a smaller priority number implies a higher priority$),$ and $\backslash ($ R R $\backslash )($quantum $\backslash (=2\backslash )).$