Analyze scheduling algorithms for the following five processes given each process’ length
and arrival time.
Processes Length Arrival Time
P1 16 0
P2 7 2
P3 2 4
P4 4 6
P5 22 8

For each of the following scheduling algorithms draw a diagram about how processes are
scheduled, calculate the turnaround time for each process and calculate the average
turnaround time.
1) First In First Out (FIFO)