Consider the following set of five processes P1, P2, P3, P4, and P5.

Process	Burst Time	Priority
P1	19	3
P2	26	1
P3	3	5
P4	11	2
P5	14	4

The priorities and the lengths of the CPU-burst time in milliseconds are given below. The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0 (except for preemptive SJF). A larger priority number implies a higher priority. Draw a Gantt chart illustrating the execution of these processes and compute the average waiting time (AWT) of each of the following CPU scheduling algorithms. Also show the waiting time for each process.

1. FCFS (First-Come, First-Served). Also calculate average execution time.
2. Non-preemptive SJF (Shortest-Job-First).
3. Preemptive SJF (Shortest-Job-First). Also show turnaround time for each process.

Process	P1	P2	P3	P4	P5
Arrival Time	0	0.4	1	2	2.5

4. Non-preemptive Priority Scheduling.
5. RR (Round-Robin)
   1. with time quantum of 10 milliseconds.
   2. with time quantum of 15 milliseconds.
   3. with time quantum of 5 milliseconds.