Q2: Consider the following set of processes. (3+2+2+1 Marks) Process P1 P2 P3 P4 PS P6 P7 P8 P9 P10 Burst Time Process Time/Service time 7 1 2 6 6 2 8 1 0 2 Arrival Time 3 4 0 2 7 5 9 3 1 4 a) Draw Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF (preemptive and non-preemptive), Round Robin (Quantum= 3). b) What is the Average turnaround time of each process for each of the scheduling algorithms in part a? c) What is the Average waiting time of each process for each of the scheduling algorithms in part a? d) On the basis of your results, which of the algorithm is more efficient (over all processes)