Q4 (a) A set of six processes given in Table 1 are planned to be executed using Preemptive Shortest Job First scheduling algorithm. Table 1: Processes in Waiting State Process Arrival Burst Number Time(ms) Time(ms) P1 2 7 P2 3 5 4 3 5 1 &&&& 6 2 7 1 Perform the following tasks using the given algorithm: () Represent the order of execution of the given processes using Gantt chart. [3] (ii) Determine the waiting time of each process. [3] (ii) Determine the turnaround time of each process. [3] (iv) Determine the average waiting time and average turnaround time of the processes. [2] (V) Determine the average response time of the processes. [2]