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 FCFS SCHEDULING ALGORITHM ATBT PRIORITY FT TATW 06 1 RT Process P1 P2 P3 P4 P5 Average SJF NON-PREEMPTIVE) SCHEDULING ALGORITHM | AT BT PRIORITY FT TATWT 2 2 5 1 RI Process P1 P2 P3 P4 P5 11 76 Average