Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 2 2 P2 1 1 P3 8 4 P4 4 2 P5 5 3 b) What is the turnaround time for each process for each of the scheduling algorithms in part a? c) What is the waiting time for each process for each of those scheduling algorithms? d) Which one of those scheduling algorithms results in the minimum average waiting time (over all processes)? Answer: Question 2 (4 points): Consider a system running ten I/O bound tasks and one CPU-bound task. Assume that the I/O-bound tasks issue an I/O operation once for each millisecond of CPU computing (1ms CPU burst), that each I/O operation takes 10 milliseconds to complete, and all I/O operations are blocking (release CPU) and independent (for example, using different devices). Assume the CPU task does no I/O and uses all CPU time it is given. Also assume that the context-switching overhead is 0.1 milliseconds and that all process are long-running tasks. Describe the CPU utilization for a RR scheduler when: a) The time quantum is 1 milliseconds. b) The time quantum is 10 milliseconds. Answer: Question 3 (2 points): For each of the following scheduling algorithms, explain how it favors short processes (if at all): a) FCFS b) RR Answer: