Given the following information:

Job	Arrival Time	CPU Cycle
A	0	8
B	3	4
C	5	1
D	7	3
E	9	2
F	11	6

Draw a timeline for the job sequence. Compute the waiting time and turnaround time for every job for each of the following scheduling algorithms (ignoring context switching overhead).

(i)

First-come, first-served

(ii)

Shortest Job Next

(iii)

shortest Remaining Time

(iv)

Round robin (using a time quantum of 3)