QUESTION 2 Answer the following questions about CPU scheduling algorithms. (14 Points) a) Consider 5 processes arriving at time 0: Burst Time 11 2 Process P1 P2 P3 P4 Ps Priority 4 1 3 4 2 3 2 6 a 1) Priority scheduling Gantt Chart. Note: you can express Gantt Chat textually, if drawing is not possible. 2) Average waiting time 3) Which inconveniency can have this scheduling, if any? Indicate the name and how this can be concretly alleviated, i.e. name the alternative. b) Consider 3 processes arriving at time 0. Process P1 P2 P3 Burst Time 25 4 4 b1) Round robin scheduling with time quantum=5 Gantt Chart. b2) Average Waiting time 3) Do you consider RR as preemptive or nonpreemptive algorithm? ar that no