In python

L Shortest Job First CPU Scheduling (7 pts) In this exerdise you will be modifying the CPU time slicing program that we discussed in Answer the questions about the algorithm, and then follow the steps to write the code. 1) Shortest Job First is a CPU scheduling algorithm that removes the shortest job from class so that It implements a shortest-job-first (SIF) scheduling algorithm Instead the process queue and executes It first. It keeps doing this until all of the processes are executed. What might be an advantage of this algorithm? What might be a disadvantage of this algorithm? 2) Download the code for the CPU time slicing program: There is one important difference between the implementation of a time slice CPU scheduling algorithm and a SIF CPUU scheduling algorithm: the Queue data structure used in the time slice program is designed for FIFO access-it only allows you to get the process at the end of the queue. To implerhenit SIF you willneed to use a list to store the processes so that we can get the shortest job to process. The main changes you will have to make to the program are: The function to get the data from the file should return two lists (a list of processes and a list of execution times) instead of a single list with both The function to schedule process will choose the next process by fiading the shortest execution time from the lists. It will replace the queue data structure with the pair of lists. a) b) c) You will have to write a function to find the shortest process from the and remove it