1.) Consider the following set of processes, with the length of the CPU burst given in milliseconds:

Process	Burst Time	Priority
P1	10	3
P2	1	1
P3	2	5
P4	1	4
P5	5	2

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 at time 0.

Draw three separate Gantt charts using the following scheduling algorithms: FCFS, non-preemptive SJF, non-preemptive priority (smaller numbers implies higher priority).

Compute the average turnaround time and the average waiting time for each of the scheduling algorithms.