Calculate the waiting time for each process and the average waiting time of the scheduling algorithm (Priority Scheduling w/ Round-Robin) on page 27 of Lecture 5 - CPU Scheduling.pdf. Work out your solution on a sheet of paper and submit a clear image of your solution.

Thank you!

- Run the process with the highest priority. Processes with the same priority run round-robin - Example: - Gantt Chart with time quantum = 2