1. Assume that the following processes are the only processes in a computer system and that there are no input/output requests from all no input/output requests from all the given processes. Given the following arrival time and CPU burst time for each process, answer the following questions. Arrival Time CPU Burst Time PA PB PC PD PE Draw the Gantt chart and compute the average waiting time for the following CPU scheduling algorithms. Here the waiting time of a process includes all the time it is in the ready queue. 1) First Come First Served (FCFS). 2) Preemptive Shortest Job First (also called Shortest Remaining Time First). 3) Round-Robin with time quantum of 2 (Assume that new processes will be inserted at the end of the ready queue)