a. Assume that the following processes in a computer system. Given the following arrival time and CPU burst time for each process, answer the following questions. Process Arrival Time CPU Burst Time P1 P2 P3 P4 0 3 5 7 20 7 2 3 Draw the Gantt chart and compute the average waiting time for the following CPU scheduling algorithms. i) First Come First Service (FCFS). ii) Preemptive Shortest Job Next (also called Shortest Remaining Job Next). in) Round-Robin with time quantum of 4 (Assume that new processes will be inserted at the end of the ready list). b. According to your results, which scheduling algorithm among those given in (a) gives the shortest average waiting time? Is that consistent with your theoretical prediction? Justify your