Consider the following processes with arrival time and burst time. Draw a Gantt chart for preemptive shortest job CPU scheduling algorithm $($delay $=1,$ in case of a tie, the FCFS will be followed$)(0\mathrm{.}5$ points$),$ find TAT and WT $(0\mathrm{.}5$ points$).$

$\backslash$table$[[$Process ID$,$Arrival time,Burst time,Priority,TAT,WT$],[$P$1,0,6,5,,],[$P$2,3,4,4,,],[$P$3,7,3,3,,],[$P$4,10,7,3,,],[$P$5,10,6,1,,]]$

$RQ=,+-$

$\backslash$table$[[,,,,,,,,,,,,,,,]]$

ATAT$=$

AWT$=$