1 2 (c) CO 4 170 4 3 (C) 60 Table 1 shows that there are four jobs in the queue. Job I arrived first, and 4 last. Their priority is given in shown in the middle column (1 is the lowest, and 4 is highest), and CPU time is shown in right column. For the following questions, please circle the correct answer from the candidate list (time unit: second). Table 1 (1) Using shortest-job-first scheduling algorithm, Job # Priority CPU time 1 tumaround time for Job 1 is 30 (a) 20 (6) 30 50 (d) 80 90 tumaround time for Job 2 is 80 (a) 100 (b) 130 (d) 250 50 tumaround time for Job 3 is (a) 100 (b) 130 150 (d) 160 tumaround time for Job 4 is (a) 30 (b) 50 (d) 80 average turnaround time is (a) 100 (b) 110 (c) (d) 130 (2) Using priority scheduling algorithm. turnaround time for Job 1 is (3) Using round-robin scheduling algorithm, turnaround time for Job 1 is (a) 230 (b) 250 (d) 400 (a) 100 (6) 120 tumaround time for Job 2 is tumaround time for Job 2 is (a) 200 (6) 220 (d) 400 (a) 200 (b) 250 tumaround time for Job 3 is turnaround time for Job 3 is 30 (b) 40 (d) 80 (a) 200 (6) 220 tumaround time for Job 4 is turnaround time for Job 4 is 130 (b) 150 c) (d) 190 (a) 100 (6) 150 (c) 180 average turnaround time is average turnaround time is (a) 125 (6) 135 170 (d) 185 (a) 1555 b) 177.5 () 185.0 120 (c) 300 140 (d) 190 (c) 300 (6) 270 (d) 300 (0) 60 240 (d) 300 160 (d) 200 c) (d) 197.5 (1) When using shortest-job-first scheduling algorithm, what is the turnaround time for Job 1, Job 2, Job 3, and Job 4? And what is the average turnaround time