Question $3$

Using the priority based round robin scheduling algorithm with a

quantum of $3ms.$ Priority $1$ processes are considered higher priority

than processes with priority $2.$ Assume that the jobs in the table are all

received immediately but in the order listed, compute the waiting time

and completion time for each job. No need to compute the average

wait time for this exercise.