In the lectures, we covered the first-come first-serve, the round-robin, and the priority scheduling algorithms. We also introduced the use of a Garut chart to show the scheduling order and the calculation of the waiting time as well as the turnaround time. Suppose that is an operating system equipped with a multiple queue priority scheduler with the following setting: The computer running the above operating system contains only one CPU with one core; A context switching takes negligible amount of time; The priority class C takes the following set of rules: - The quantum of each process is the same and is 3 time units; - When the scheduler has used up the quantum of every process of this class, the scheduler resets the quantum of every process to 3 time units; - The processes are sorted according to their arrival time, and they are arranged as a queue; - If the scheduler wants to choose a process from this priority class to run, then the scheduler will always choose the first process, which has non-zero quantum, in the queue to run; The following table is the set of CPU-bound processes arriving at the system: (a) If the scheduler is a static-priority scheduler and a newly-arrived process will not preempt the running process: i. Draw a Gantt chart to show the scheduling order of the above processes. The Gantt chart should show a correct scheduling order with correct time moments that the scheduler switches from one process to another process. ii. Calculate the waiting time and the turnaround time of each process