The following processes are being scheduled using a preemptive, prioritybased, round-robin scheduling algorithm. Each process is assigned a numerical priority, with a higher number indicating a higher relative priority. The scheduler will execute the highest priority process. For processes with the same priority, a round-robin scheduler will be used with a time quantum of 10 units. If aprocess is preempted by a higher-priority process, the preempted process is placed at the end of the queue. A. Show the scheduling order of the processes using a Gantt chart. B. What is the turnaround time for each process? C. What is the waiting time for each process