1. Scheduling with FIFO, SJF, and SRT. (a) For the 5 processes described below, draw a timing diagram showing when each process executes under FIFO, SJF, and SRT. pl p2 p3 p4 p5 Process Arrival time 0 2 4 6 8 Total CPU time 3 6452 (b) Determine the ATT for each scheduling algorithm for the 5 processes. 2. Scheduling with FIFO, SJF, and SRT. (a) Starting at time 0, a new process p of length 3 arrives every 4 time units. Starting at time 1, a new process q of length 1 arrives every 4 time units. Determine the ATT under FIFO, SJF, and SRT. 3. The following sequence of CPU bursts has been observed: 7, 5, 6, 15, 15, 15. (a) Using 7 as the initial estimate, So, generate the sequence of predictions, S;, for the corresponding observed values, T;, where 1 i 5 and a = 0.8. (b) Repeat the same predictions for a = 0.5.