Code in python or C please

1. Implement the FCFS (non preemptive) CPU scheduling algorithm. Use any programming language. The code will be submitted with the report. Simulate and evaluate with the set of processes described below. For each algorithm (FCFS, SJF, and MLFQ) Calculate the CPU Utilization, Response time (RT) per process and average, Waiting Time (WT) per process and average, and Turnaround Time (TT) per process and average. 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. 5. Turnaround time is a total of (Waiting time )+(CPU burst time )+(I/O time) 6. Response time is the first measure of waiting time -arrival at time 0 until the first time on the CPU Process Data: process goes \{CPU burst, I/O time, CPU burst, I/O time, CPU burst, I/O time,......., last CPU burst \} Aditional Instructions: - All code for the FCFS implementation must be in one text file - The process data must be included in the source code file and cannot be read from an input file - Any assignment that reads the process data from an input file will not be graded - The FCFS CPU scheduler simulation should print the following information onto the screen at each context switch Current time - The list of processes in the ready queue and the length of the next CPU burst The list of processes in I/O and the remaining time left in I/O The next process to be dispatched onto the CPU - Only print information on each context switch, do not print at each time unit - The end of the FCFS execution the calculated results must be displayed on the screen and must be well formatted. - The results include (CPU utilization, RT, WT, TT (per process and average))