1. Table Ishows 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. For the following questions, please fill the blanks (time unit: msec) 1) Using first-come first-serve scheduling algorithm Table 1 Job # Priority CPU time turnaround time for Job 1 is turnaround time for Job 2 is: turnaround time for Job 3 is: tunaround time for Job 4 is: average turnaround time is 150 250 350 450 2 2) Using shortest-job-first scheduling algorithm, turnaround time for Job 1 is: turnaround time for Job 2 is: turnaround time for Job 3 is: turnaround time for Job 4 is: average turnaround time Using priority scheduling algorithm, is: 3) turnaround time for Job 1 is turnaround time for Job 2 is: turnaround time for Job 3 is: turnaround time for Job 4 is: average turnaround time is: Using round-robin scheduling algorithm, 4) turnaround time for Job 1 is: turnaround time for Job 2 is: turnaround time for Job 3 is: turnaround time for Job 4 is: average turnaround time is