We have four jobs as follows:

Job	Arrival time	CPU Burst Length
A	2	2
B	1	4
C	0	5
D	3	3

Assuming that the Shortest Remaining Time First (SRTF - preemptive version of Shortest Job First) scheduling policy is used to schedule job CPU bursts, choose the job that will be scheduled in each of the time slot starting at each of the times indicated in the table below. If no job is scheduled in a given time slot, choose "-". Convention: if two jobs have the same remaining time, choose job that arrived earlier first.

0	[ Select ] ["A", "B", "C", "D", "-"]
1	[ Select ] ["A", "B", "C", "D", "-"]
2	[ Select ] ["A", "B", "C", "D", "-"]
3	[ Select ] ["A", "B", "C", "D", "-"]
4	[ Select ] ["A", "B", "C", "D", "-"]
5	[ Select ] ["A", "B", "C", "D", "-"]
6	[ Select ] ["A", "B", "C", "D", "-"]
7	[ Select ] ["A", "B", "C", "D", "-"]
8	[ Select ] ["A", "B", "C", "D", "-"]
9	[ Select ] ["A", "B", "C", "D", "-"]
10	[ Select ] ["A", "B", "C", "D", "-"]
11	[ Select ] ["A", "B", "C", "D", "-"]
12	[ Select ] ["A", "B", "C", "D", "-"]
13	[ Select ] ["A", "B", "C", "D", "-"]
14	[ Select ] ["A", "B", "C", "D", "-"]
15	[ Select ] ["A", "B", "C", "D", "-"]