Process	Arrival Time	Burst or Service Time	Priority
P1	0	3	3
P2	2	6	1
P3	4	4	3
P4	6	5	4
P5	8	2	2

The lower number priority means high priority and the quantum time is 4 milliseconds

#1

1) Draw the Gantt charts that illustrate the execution of these processes using the following scheduling algorithms:

FCFS, Non-Preemptive SJF (NP-SJF), Preemptive SJF (P-SJF), Non-Preemptive Priority (NP-P),

For Question 2 Part a) and Question 3 Part a), provide your answers in a table format

#2

2a) What is the turnaround time of each process for each of the scheduling algorithm in Question 1)?

2b) Which algorithm results in the minimum average turnaround time?

#3

3a) What is the average waiting time of each process for each of the scheduling algorithm in Question 1)?

3b) Which algorithm results in the minimum average waiting time?