Consider 5 processes whose Arrival time (AT), CPU Burst time(BT) and PRIORITY is as follows. Solve the given problem and fill up the following Table. Note: FT Finish Time, TAT Turn Around Time, WT Waiting Time, RT Response Time

Process SJF (PREEMTIVE ) SCHEDULING ALGORITHM AT BT PRIORITY FT TATWT 02 RT P1 P2 P3 1 P5 Average ROUND ROBIN SCHEDULING ALGORITHM (TIME QUANTUM = 2) Process AT BT PRIORITY FT TATWT RT P1 P2 2 5 5 3 1 1 Average PRIORITY SCHEDULING (Preemptive ) ALGORITHM (least number - higher priority) Process AT BT PRIORITY FT TATWT RT Average