Question 1: [10 marks] a) What advantage is there in having different time-quantum sizes at different levels of a multilevel queueing system? (4 marks) b) Suppose that a scheduling algorithm (at the level of short-term CPU scheduling) favors those processes that have used the least processor time in the recent past

Question 1: [10 marks] a) What advantage is there in having different time-quantum sizes at different levels of a multilevel queueing system? (4 marks) b) Suppose that a scheduling algorithm (at the level of short-term CPU scheduling) favors those processes that have used the least processor time in the recent past. Why will this algorithm favor 1/0-bound programs and yet not permanently starve CPU-bound programs? (3 marks) c) Discuss Min-Max and Max-Min CPU scheduling algorithms in modern operating systems and state their drawbacks. (3 marks)