Please help: Analyze the performance of three scheduling mechanisms: Exponential Averaging, MLFQ, and true ShortestRemainingTimeFirst (SRTF). True SRTF pre-empts after a time quantum of 3, the pre-empted process remains in the ready queue and now has a shorter remaining time. Calculate the Average Completion Time AND count the number of context switches. The workload consists of the following: P1: 9(3,2,4); P2: 8(2,6); P3: 16(2,4,6,4). I/O between bursts for 4 time quantums, multiple processes can do concurrent I/O. Exp Ave default =2, alpha=0.6. True SRTF, pre-empt after 3, remain in ready queue. MLFQ: 3 queues of 2,4 and 8 quantums for the queues. Processes are executed in FIFO order within each queue. No pre-emption. Ave completion time = Ave Competion Time = True SRTF with pre-emption, quantum=3: P1: 9(3,2,4); P2: 8(2,6); P3: 17(2,4,6,4) MLFQ: Executing in Queues Time 0 Q1:2 Q2:4 Q3:8 MLFQ: In Queues Q1 1,2,3 Q2 Q3 IO:4 Time 0 Executing ReadyQ P1:3 P2:2 P3:2 I/O:4 Analyze the performance of three scheduling mechanisms: Exponential Averaging, MLFQ, and true ShortestRemainingTimeFirst (SRTF). True SRTF pre-empts after a time quantum of 3, the pre-empted process remains in the ready queue and now has a shorter remaining time. Calculate the Average Completion Time AND count the number of context switches. The workload consists of the following: P1: 9(3,2,4); P2: 8(2,6); P3: 16(2,4,6,4). I/O between bursts for 4 time quantums, multiple processes can do concurrent I/O. Exp Ave default =2, alpha=0.6. True SRTF, pre-empt after 3, remain in ready queue. MLFQ: 3 queues of 2,4 and 8 quantums for the queues. Processes are executed in FIFO order within each queue. No pre-emption. Ave completion time = Ave Competion Time = True SRTF with pre-emption, quantum=3: P1: 9(3,2,4); P2: 8(2,6); P3: 17(2,4,6,4) MLFQ: Executing in Queues Time 0 Q1:2 Q2:4 Q3:8 MLFQ: In Queues Q1 1,2,3 Q2 Q3 IO:4 Time 0 Executing ReadyQ P1:3 P2:2 P3:2 I/O:4