Chegg repeat increment t if there is at least one active process choose from the active processes a process Pᵢ to run next, according to the scheduling algorithm. decrement Rᵢ (Pᵢ has accumulated 1 CPU time unit) if Rᵢ == 0 (process i has terminated) set active flag of Pᵢ = 0 TTᵢ = t - Aᵢ end if until Rᵢ == 0 for all n processes (all processes have terminated) compute the average turnaround time, ATT, by averaging all values TTᵢ