The following processes are being scheduled using a priority-based, round-robin scheduling algorithm. Process Priority Burst Arrival P1 10 0 4 P2 11 20 0 P3 2 30 15 P4 2 20 20 P5 3 5 40 P6 3 15 50 Each process is assigned a numerical priority, with a higher number indicating a higher priority. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. a) Show the scheduling order of the processes using a Gantt chart. b) What is the waiting time for each process? c) What is the average waiting time of all the processes