Q$6.$ Consider the following processes P$1,$ P$2,$ P$3,$ P$4,$ with CPU burst time and arrival time given in milliseconds. Using Priority Scheduling Algorithm $($NonPreemptive$),$ draw a Gantt Chart and calculate: $($a smaller number implies a higher priority$).$

a$.$ Average waiting time

b$.$ Throughput

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