Please do question 2 only.

1. Assume that a system has following processes and their arrival and burst times Process Arrival TimeBurst Time P1 P2 P3 12 4 4 a) b) c) Draw the Gantt chart and calculate the waiting and turnaround times for each process using a FCFS scheduling algorithm? Draw the Gantt chart and calculate the waiting and turnaround times for each process using a non-preemptive SJF scheduling algorithm? The SJF algorithm is supposed to improve performance, but notice that we usually choose to run process P1 at when it arrived because we did not know that two shorter processes would arrive soon. Compute what the waiting and turnaround times will be if the CPU is left idle for the first 1 unit and then a non-preemptive SJF scheduling is used. Remember that processes P1 is waiting during this idle time, so its waiting time may increase. This algorithm could be called future- knowledge scheduling 2. Assume that a system has following processes, their priority and arrival times: Prior Burst Time Process P1 P2 P3 P4 P5 4 4 The processes are assumed to have arrived in the order P1, P2, P3, P4, PS, aa time 0 a) b) c) d) Draw the Gantt chart and calculate the waiting and turnaround times for each process using a FCFS scheduling algorithm? Draw the Gantt chart and calculate the waiting and turnaround times for each process using a non-preemptive SJF scheduling algorithm? Draw the Gantt chart and calculate the waiting and turnaround times for each process using a non-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 2