Consider the following set of six processes, with the CPU burst time $($in

milliseconds$),$ and priority.

Process Burst time Priority

P$1301$

P$252$

P$3223$

P$4101$

P$5252$

P$6503$

Draw a Gantt charts that illustrate the execution of these processes using the

priority scheduling algorithms $($a smaller priority number implies a higher

priority$)$ and compute the average wait time