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

PRIORITY SCHEDULING (Preemptive ) ALGORITHM (least number higher priority) Process ATBT PRIORITY FT TATWTRT P106 1 P2 P3 | 5 2 1 16 6 3 Average