consider the following set of processes:

Process	Arrival time	Priority	CPU burst
P1	0	3	3
P2	1	2	5
P3	3	2	2
P4	9	1	2

For each of the following scheduling algorithms, draw a Gantt chart showing which process will be running in the CPU and calculate the average waiting and the average turnaround time.

1. a) SJF (preemptive)

2. b) Priority (non-preemptive)

3. c) Priority (preemptive)

4. d) RRwithq=2