FCFS = First come first serve algorithm

Implement the following CPU scheduling algorithms - . Simulate and evaluate each with the set of eight processes below FCFS non-preemptive (results provided) Assumptions: 1. All processes are activated at time 0 2. Assume that no process waits on I/O devices 3. After completing an I/O event, a process is transferred to the ready queue 4. Waiting time is accumulated while a process waits in the ready queue Process Data process goes {CPU burst. I/O time, CPU burst, 10 time, CPU burst. time last CPU burst) P1 14,24,5,73,3,31,5,27,4,33,6,43,4,64,5,19,2) 2(18,31, 19, 35, 11,4218,4319,47,1 8,43,17,51, 1932,10} P3 16,18,4,21,7,19,4,16,5,29,7,21,8,22,6,24,5) P4 117,42,19,55,20,54,17,52,15,67,12,72,15,66,14) P5 (5,81,4,82,5,71,3,61,5,62,4,51,3,77,4,61,3,42,5) P6 10,35,12,41,14,33,11,32,15,41,13,29,11) 7(21.51 ,23.5324,61 ,22.31 ,21.43.201 P8 11,52,14,42,15,31,17,21,16,43,12,31,13,32,15) FCFS 82.02% 285.875 691.5 36.25 FCFS CPU utilization: 82.02% Ttr 670 756 563 746 901 610 599 687 691.5 Th 318 283 341 209 272 313 229 322 285.875 Tr CPU utilization Avg Waiting time (Tw Avg Turnaround time (Ttr Avg Response time (Tr) 4 28 45 50 60 81 36.25 Write the simulation program in a programming language (in Ct+t or Python) Implement the following CPU scheduling algorithms - . Simulate and evaluate each with the set of eight processes below FCFS non-preemptive (results provided) Assumptions: 1. All processes are activated at time 0 2. Assume that no process waits on I/O devices 3. After completing an I/O event, a process is transferred to the ready queue 4. Waiting time is accumulated while a process waits in the ready queue Process Data process goes {CPU burst. I/O time, CPU burst, 10 time, CPU burst. time last CPU burst) P1 14,24,5,73,3,31,5,27,4,33,6,43,4,64,5,19,2) 2(18,31, 19, 35, 11,4218,4319,47,1 8,43,17,51, 1932,10} P3 16,18,4,21,7,19,4,16,5,29,7,21,8,22,6,24,5) P4 117,42,19,55,20,54,17,52,15,67,12,72,15,66,14) P5 (5,81,4,82,5,71,3,61,5,62,4,51,3,77,4,61,3,42,5) P6 10,35,12,41,14,33,11,32,15,41,13,29,11) 7(21.51 ,23.5324,61 ,22.31 ,21.43.201 P8 11,52,14,42,15,31,17,21,16,43,12,31,13,32,15) FCFS 82.02% 285.875 691.5 36.25 FCFS CPU utilization: 82.02% Ttr 670 756 563 746 901 610 599 687 691.5 Th 318 283 341 209 272 313 229 322 285.875 Tr CPU utilization Avg Waiting time (Tw Avg Turnaround time (Ttr Avg Response time (Tr) 4 28 45 50 60 81 36.25 Write the simulation program in a programming language (in Ct+t or Python)