Consider the following variation on the interval schedulingproblem. you have a processor that can operate 24 hours a day, every day. people submit requests to run daily jobs on theprocessor. each such job comes with a start time and an end time; if the job is accepted to run on the processor, it must runcontinuously, every day, for the period between its start and endtimes. (note that certain hobs can begin before midnight and endafter midnight; this makes for a type of situation different fromwhat we saw in the interval scheduling problem). given a list of n such jobs, you goal is to accept as many jobs aspossible (regardless of length), subject to the constraint that theprocessor can run at most on job at any given point in time. provide an algorithm to do this with a running time that ispolynomial in n. you may assume for simplicity that no two jobshave the same start or end times. example: consider the following 4 jobs, specified by (start-time, emd-time) pairs: (6 p. m., 6 a. m), (9 p. m., 4 a. (3 a. m., 2 p. (1 p. m., 7p. optimal solution would be to pick the two jobs (9 p. m., 4a. m.) and (1 p. m., 7 p. which can be scheduled withoutoverlapping. analyze the running time complexity and prove the optimality ofthe algorithm you provide. hint: the interval scheduling algorithm(below) may be utilized once we somehow "cut" thearound-the-clock timeline. theobjective of cutting the timeline is to convert the circulartimeline to a linear timeline as given in the interval schedulingproblem of the textbook. think how you can do that. one wayis to remove a job and all other jobs overlapping it. since thereare n jobs, there are n different cases of cutting the circulartimeline. you can then compare the cases to pick an optimalone. initially, let r be the set of all requests, and let a beemptywhile r is not yet emptychoose a request i ∈ r that has the smallest finishingtimeadd a request i to adelete all requests from r that are not compatible with requestiendwhilereturn the set a as the set of accepted requests