Consider the following processes with arrival time and burst time. Draw a Gantt chart for non$-$preemptive priority$-$based CPU scheduling algorithm $($dispatch delay $=1,$ the highest number means the lowest priority, in case of the same priority, SJF algorithm will be$\_$used to break the tie.$)(0\mathrm{.}5$ points$),$ find TAT and WAT $(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,,]]$

A$1$A$1=$

Aw $1=$