Calculate the waiting time for each process and the average waiting time of the scheduling algorithm (Priority Scheduling w/ Round-Robin)

All processes have an arrival time of 0

5.3.5 Priority Scheduling (cont.) Priority Scheduling w/ Round-Robin - Run the process with the highest priority. Processes with the same priority run round-robin - Example: - Gantt Chart with time quantum = 2