Consider 5 processes whose Arrival time (AT), CPU Burst time (BT) and PRIORITY is as follows. Solve the given problem and following Table. Note: FT - Finish Time, TAT-Turn Around Time, WT - Waiting Time, RT - Response Time FCFS SCHEDULING ALGORITHM Process BT PRIORITY FT TAT WT RT AT Average SJF (NON-PREEMPTIVE) SCHEDULING ALGORITHM BT PRIORITY | Process FT WT Average SJF (PREEMTIVE) SCHEDULING ALGORITHM BT PRIORITY TAT Process Process Average ROUND ROBIN SCHEDULING ALGORITHM (TIME QUANTUM = 2) AT PRIORITY FT TAT WTRT lo Average PRIORITY SCHEDULING (Preemptive ) ALGORITHM (least number - higher priority) BT PRIORITY FT TAT W T Process RT 21 7 7 2 Average