Now, assume that P$1$ arrives in the ready queue at time $0,P2$ at time $4,P3$ at $13,$ and P$4$ at time $22.$ The CPU execution times for the processes are the same as in Part I:

Process Execution Time

$\backslash$table$[[$P$1,12],[$P$2,19],[$P$3,7],[$P$4,18]]$

Draw the Gantt chart and calculate the total wait time for each of the following scheduling algorithms:

Shortest Job First

Shortest Remaining Time Next $($remember$,$ this is a preemptive algorithm$)$

Preemptive priority with the following priorities:

Process Priority

$\backslash$table$[[$P$1,2],[$P$2,4],[$P$3,1],[$P$4,3]]$

Assume the highest priority has the lowest number $($i$.$e$.,1$ is the most important$)$

$4.$ Non$-$preemptive priority with the same priorities as above. Be sure to note priority inversion if$/$when it occurs. Remember that priority inversion occurs when a process with a lower priority executes instead of a process with a higher priority