We have four jobs as follows:

Job	Arrival Order	CPU Burst Length
A	4	1
B	2	4
C	1	3
D	3	2

Use the Non-Preemptive First Come First Served (FCFS) scheduling algorithm and answer the following questions. Assume that all jobs arrive at time 0, in the order shown above.

1. What is the waiting time for each job (i.e., how many units of time must it wait before it is scheduled)?

Job	Waiting Time
A
B
C
D

2. What is the turnaround time for each job?

Job	Turnaround Time
A
B
C
D