Consider the following 4 processes with arrival time, burst time, and priority as follows:

Process Arrival Burst Priority

P1 0 3 3

P2 1 4 1

P3 2 1 2

P4 3 4 4

Use preemptive SJF algorithm to draw the Gantt chart and find the average waiting time.

Use preemptive priority scheduling algorithm to schedule these processes drawing the resulting Gantt chart and find the average wait time.

Use Round Robin with a quantum of 1 unit to find average wait time.