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 list. Job P1 P2 P3 P4 Arrival Time Om In7 0 3 5 7 CPU Burst Time 20 7 23 2 3 (1) First Come First Service (FCFS). And what is the waiting time with this policy (Show your work)? (5 points) (2) Non-preemptive SJF scheduling. And what is the waiting time with this policy (Show your work)? (5 points) (3) Round-Robin algorithm with time quantum of 4 (Assume that new processes will be inserted at the end of the ready list). And what is the waiting time with this policy (Show your work)? (5 points) (4) According to your results, which scheduling algorithm among those given in the above gives the shortest average waiting time? Is that consistent with your theoretical prediction? Justify your answer. (5 points)