3. (40 points) CPU Scheduling (I) Consider the following set of six processes, with the length of the CPU burst time iven in milliseconds Process Arrival Time (ms Burst Time (ms) PI P2 P3 P4 P5 14 12 17 a) (12 points) Draw four Gantt charts that illustrate the execution of these processes using the scheduling algorithms listed below: (i) First-Come-First-Serve (FCFS) (i) Shortest-Job First (SIF) (iii) Shortest-Remaining-Time-First (SRTF)(preemptive) (iv) Round-Robin (quantum = 6) (RR) b) 6 points) What is the turmaround time of each process for each of the following scheduling algorithms? Turnaound time FCFS SIF PI P2 P3 P4 P5 c) (6 points) What is the waiting time of each process for each of the following scheduling algorithms? P1 P2 P3 P4 P5 Waiting time STF