Using the following table, assume a system with three processes as follows. Process CPU Burst Arrival Time Priority P1 16 0 3 P2 12 8 1 P3 9 18 2 Question 1 (CLO 1.1/PLO K1) [4 Points] Draw the Gantt chart and Find the average waiting time for each of the following scheduling algorithms: 1- FCFS (First come first serve) algorithm. 2- SJF (Shortest job first - non preemptive) 3- SRT (Shortest remaining time) aka (SJF Preemptive) algorithm. 4 Priority scheduling algorithm (Preemptive). 5- RR (Round Robin) algorithms. Assume the Round Robin algorithm with quantum=8 MSc. Question 2 (CLO 1.2 / PLO K1) [1 Point] Which algorithm is the optimal CPU scheduling in term of waiting time