For problems $14$

Consider the followwing set of processes, with the length of the CPU burst given in milliseconds.

$\backslash$table$[[$Process$,$Arrival Time,Burst Time,Priority$],[$P$1,2,1,2],[$P$2,0,4,3],[$P$3,1,6,1],[$P$4,3,5,4]]$

The processes are assumed to have arrived in orders P$1,$ P$2,$ P$3,$ and P$4,$ all at time $0.$

Draw four Gantt charts that illustrate these processes' execution using the following scheduling algorithms: FCFS$,$ SRTF $($Shortest Remaining Time First$),$ Preemptive Priority $($lower priority number implies higher priority$),$ and RR $($quantum $=2).$ Compute average waiting time for each process using the chart. $(8$ points$)$