please only write the codes in python for

1)FCFS

2) Round robin

3) page replacement

4) FIFO

5) LRU

6)optimal

7) exit

the output should look like this

OS Simulator A. Preject Objectives: This programming prejoct is to simelare the CPU scheduling algorithens, banker's algorithm, page replacement algorithms discusod in the clan. Yoe will write a program to implement a simulator with difforent alporidtens, The program cutputs a mene to the user, where the eser selects hivher choice from the menu. In case of CPU scheduling algorithms, the simulator selects a task to ran from ready queve based on the schoduling alporithm. Sithoc the projoct intersds to simalute a CPU schedular, so it does set roquine aby actaal process creation of evecution. When a task is schedriled, the simulator will simply peimt out what tak is selocted to nan at a time. If outpets the way similar io Gant chart style. Other choices will be treated as discussed in the class. The ever can run any algorithm B. Project Descriptinnes The selected schodufing algonithms to implement is this preject aec. 1. Fint Come Fins Serve (FCFes. 4. Round Robin m. 6. First in Fint out FIFO 7. Least recent used 8. Optima! 9. Exit C. Requirements: 1. The project requires to simulate FCFS, SIF preengeive and none precmptive, and the RR, schoduling for given taiks by reading: 1. The number of peocesses. 2. The arrival time for each process, indicate 0 for not given aftival time. 3. The Burst time for each process. You ate required compute: 1. The average waiting time for cack poocess. 2. The average waiting time. 3. The tumareund time for each process. 4. The average tumarocand time. 5. Draw the Gantr Chart III. The project requires to simulate the pase replacemeat algorithm either, FIFO, Optimal, or L.RU by realies 1. The size of the frate. 2. The reference strings. You ate teqaired comprite: 1. Number of page funlts 2. Both hit and miss ratie What is the number of algorithm_processes: 4 What is the arrival time for process 1 (or enter if not given): What is the burst_time time for process 1: 6 What is the arrival time for process 2 (or enter if not given): What is the burst_time time for process 2:8 What is the arrival time for process 3 (or enter if not given): What is the burst_time time for process 3:7 What is the arrival time for process 4 (or enter if not given): What is the burst_time time for process 4:3 Average Waiting Time: 7.00 Average Turnaround Time: 13.00 ProcessArrivalTimeP1P2P3P4BurstTime0000CompletionTimeWaitingTime6873TurnaroundTime92416331690924163 Gantt Chart: P4 1 *** P1