1. Process Scheduling and Memory Management (25 Marks) (a) The Shortest Remaining Time First (SRTF) is a variant of Shortest Job First (SJF) with pre-emption added in. Consider the following five processes vying for the CPU. The scheduler uses SRTF. The scheduler re-evaluates which process to run only upon the arrival of a new process into the scheduling queue, or the completion of a process. The table shows the arrival time of each process. Process P1 P2 P3 P4 P5 Arrival time TO To + 2ms To +3ms To + 4ms To +5ms Execution time 6ms 5ms 1ms 4ms 2ms The scheduling starts at time TO. Fill in the table below with the process that is executing on the processor during each time slot. 0 1 2 3 Time Interval TO+ Process Running Time Interval TO+ Process Running Use the tables with process and remaining time to show your work as to how you arrived at the above schedule. [5 Marks] (b) (c) How would you prevent starvation in a multi-level queue scheduling algorithm? [2 marks] What scheduling policy would you normally choose for the following systems? Why? (i) A time sharing system (ii) A batch system [2 marks]