75pts] b) Consider the set of processes: (10 pts for each correct GANTT chart) Process ID Arrival TimeBurst Time Priority P2 P3 P4 60 30 40 10 4 4 Draw the GANTT chart for the following scheduling algorithms. First-Come First-Served (FCFS) * Shortest Job First (SJF) (Non-preemptive) * Shortest Remaining Time First (SRTF) Round Robin (RR) (Time Quantum = 10) Priority (Preemptive) When priority is being used, a smaller priority number means higher execution priority. For tie-breaking cases, the process with the earlier arrival time should execute. And complete the following table with the average waiting time and turnaround time of each algorithm (2.5 pts for each correct answer Scheduling Algorithm First Come First Served (FCFS Shortest Job First (SJF) (Non-preemptive Shortest Remaining Time First (Preemptive) Round Robin (RR) ime Quantum = 10) Prior Average waiting timeAverage turnaround time Preemptive