RR scheduling = Round Robin scheduling

2. Assume that a system has following processes, their priority and arrival times: Prior Process P1 P2 P3 P4 P5 Burst Time 10 29 4 10 12 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0 a) b) c) d) Draw the Gantt chart and calculate the waiting and turnaround times for each process using a preemptive SJF scheduling algorithm? Draw the Gantt chart and calculate the waiting and turnaround times for each process using a preemptive priority scheduling algorithm (a larger priority number implies a higher priority? Draw the Gantt chart and calculate the waiting and turnaround times for each process using a RR scheduling algorithm with a quantum of 5? Draw the Gantt chart and calculate the waiting and turnaround times for each process using a RR scheduling algorithm with a quantum of 10