Question 1 (60 points) 1. Table 1 shows that there are four jobs in the queue. Job 1 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. Answer the following questions (time unit: second): Table 1 Job # | Priority | CPU time 200 500 100 300 4 2 Fig.1 IVV 4 300 Fig.1 What is the turnaround time of job 4 when using FCFS scheduling algorithm (no need to put unit)? A What is the average turnaround time when using FCFS scheduling algorithm (no need to put unit)? A What is the tumaround time of job 4 when using shortest-job-first scheduling algorithm (no need to put unit)? A What is the average turnaround time when using shortest-job-first scheduling algorithm (no need to put unit)? A What is the turnaround time of job 4 when using priority scheduling algorithm (no need to put unit)? A What is the average turnaround time when using priority A/ has the scheduling algorithm (no need to put unit)? turnaround time of job 1 when using round-robin scheduling algorithm (no need to put unit)? A What is the average turnaround time when using round-robin scheduling algorithm (no need to put unit)