#...... OS , Operating System

1. Given the processes below with its arrival time, CPU burst time and Priority. Answer the following questions using the following algorithms: a. Round Robin with time quantum of 20 milliseconds. Process D1 Arrival Time 0 Burst Time 29 42 0 D2 D3 0 35 i. Draw the Gantt Chart (3 marks) ii. Calculate the waiting time for each process (2 mark) iii. Calculate the average waiting time (1 mark) b. Using Non-Preemptive Priority Scheduling Algorithm Process Arrival Time 0 Burst Time Priority R1 6 2 R2 0 7 3 R3 0 23 1 i. Draw the Gantt Chart (2 marks) ii. Calculate the waiting time for each process (1.5 marks) iii. Calculate the average waiting time (0.5 mark)