Please solve this

2. Assume that a system has following processes, their priority and arrival times: Process P1 P2 P3 P4 P5 Priority Burst Time 4 4 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time O. 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 SJF scheduling algorithm? Draw the Gantt chart and calculate the waiting and turnaround times for each process using a nonpreemptive 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