OPERATING SYSTEMS Q#1) Consider the following set of processes, with the length of the CPU burst given in milliseconds: Processes Arrival Time Burst Time Priority P1 1 5 4 P 2 3 1 P3 3 1 2 P4 st 7 2 PS 5 4 3 1. Draw four Gantt charts that illustrate the execution of these processes usingthe following scheduling algorithms: FCFS, SJF, preemptive priority (a larger priority number implies a higher priority), and preemptive RR (quantum = 2). Hint: In Preemptive priorityand Preemptive RR use prioritieswith the arrivaltime to make the Ganttchart 1. What is the turnaround time of each process for eachof the scheduling algorithms in part a? 2. What is the waiting time of each process for each of these scheduling algorithms? 3. Which of the algorithms results the minimum average waiting time (over all processes)? 4. What is the CPU utilization rate