Consider the following set of processes, with the length of the CPU burst time given in milliseconds:

Question 4. [9 marks] Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Arrival Time Bust Time P1 0 16 P2 0 10 P3 6 4 P4 7 6 P5 8 10 a. Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF (preemptive), and RR (q = 10). b. What is the waiting time of each process for each of these scheduling algorithms? c. Which of the algorithms results in the minimum average waiting time (over all processes)