Text: Process
Arrival Time
Burst Time
P1
6
10
P2
30
29
P3
15
3
P4
0
7
P5
12
12
Given the set of processes that all arrive at time 0, calculate
the average waiting time and turnaround time when the following
scheduling algorithm is applied:
1. Preemptive FCFS
2. Non-preemptive SJF
3. Round-Robin (quantum = 10)