Chapter 5 5.1 Explain the difference between preemptive and nonpreemptive scheduling. 5.2 In section 5.2 it is mentioned that disabling interrupts frequently can affect the system's clock. Explain why this can occur and how such that effect can be minimized? 5.3 Suppose the following processes arrive for execution at the times shown below. Each process will run for the amount of burst time listed. For the problems shown below, assume nonpreemptive scheduling. Base all decisions on the information you have at the time the decision must be made. Process ArrivalTime BurstTime P1 0.0 8 P2 0.4 4 P3 1.0 1 a) What is the average turnaround time for these processes with the FCFS scheduling algorithm? b) What is the average turnaround time for these processes with the SJF scheduling algorithm? 5.4 What is the advantage of having different time-quantum sizes at different levels of a multilevel queueing system? 5.5 Suppose that a short-term scheduling algorithm favors processes that have used the least processor time in the recent past. Why will this algorithm favor I/O-bound programs and not yet permanently start CPU-bound programs? 5.6 What is the difference between pthreads PCS and SCS scheduling?