Operating system.

SECTION III Processor Scheduling Problems The following table of jobs are to be processed using SRTF and RR. There is a lms of context switching time on both algorithm and 3 ms of quantum to be used in RR. Assume a single serial I/O device in your solution. Jobs Arriving time (ms Burst Time (ms) VO time (ms 4 1. Comparing the performance of SRTF and RR scheduling algorithms (Response time Waiting time and Turnaround time) on above table of processes, SRTF performance can be described as a) worse, worse, worse b) Better, worse, better c) Better better, better d) Better, worse, better 2. The turnaround time (ms) for the processes A,B,C using RR scheduling algorithm are a) 21, 22, 18 b) 18, 17, 10 c) 18, 18, 11 d) 21, 22, 10 3. The waiting time (ms) for the processes A,B,C using SRTF scheduling algorithm are a) 8, 1,9 b) 1,8, 9 c) 8, 1,9 d) 9,1, 8 4. The Response Time (ms) of the processes A B cusing SRTF scheduling algorithm are a) 0, 0, 1 b),0 d) 0,1, 1