Exercise 5 Suppose the following processes which arrive for execution at the indicated arrival time. Each process will require the CPU during a period equal to the indicated burst time. Process Burst time Arrival time 0.0 P1 8 P2 0.4 4 P3 1.0 1 a. By using the FCFS scheduling algorithm (First Come First Served): 1) Identify the values x, y and z shown in the table given below. 2) Deduce the average turnaround time Process P1 P2 P3 CPU allocation time 0-8 8-12 Turnaround time (total time between submission of a process and its completion) 8 11.6 Z b. What is the average turnaround time for these processes by using the SJF scheduling algorithm (Shortest Job First)? c. Calculate the average turnaround time if the processor is idle during the first 1 unit of time (this means until all processes are ready) and then SJF scheduling algorithm is used