Process	Arrival time	Burst time	Priority
P1	2	11	2
P2	1	28	0
P3	3	2	3
P4	4	10	1
P5	5	16	4

Given the following mix of job, job lengths, and arrival times, assume a time slice of four (4) and compute the completion time, turnaround time, and waiting time for each job. Draw the Gantt chart and suggest an application for each job. (Consider 5 as a highest priority and 0 as a lowest priority). (36 Marks) a. First Come First Serve (FCFS) algorithm b. Shortest Job First Scheduling (SJF) algorithm c. Shortest Remaining time (SRT) algorithm d. Non-preemptive priority Scheduling algorithm e. Preemptive priority Scheduling algorithm f. Round-Robin Scheduling algorithm