5. The following sets of processes have arrived in the process queue at the following times. Assuming a FCFS scheduling algorithm, draw a GANTT chart showing their processing sequence a. Calculate the average waiting time ii. i. Calculate the Calculate the throughput time iii. Assuming a pre-emptive priority scheduling algorithm which will process tasks of the same priority in an FCFS fashion, draw a GANTT chart showing their processing sequence. b. Calculate the average waiting time ii. Assume that you have a round robin scheduler with a quantum of 10 that ignores priority draw a GANTT chart showing thei Calculate the turnaround time c. r processing sequence i. Calculate the average waiting time ii Calculate the turnaround time Process P1 P2 Arrival Time Burst Duration 20 10 Priority (0 is highest P4 P5 20 45 35 15 4