Operating system

(b). Given the following information:

Job	Arrival time	CPU cycle
A	0	8
B	2	5
C	3	1
D	5	3
E	8	3
F	10	1
G	11	4

Draw a timeline for each of the process scheduling algorithms showing the time that each job arrives and the order that each is processed. Calculate the turnaround time for each job.

(i). First Come First Serve

(ii). Shortest Job First

(iii)Shortest Remaining Time

(iii)Round Robin (using a time quantum of 3, ignore context switching)