There are N jobs, and each needs to run from time exactly si to ti$.$ The CS department decided that it wants all jobs to be run, but to do so with the least number of machines, where each machine can only run one job at a time. Find the schedule of jobs that uses the minimum number of necessary machines. $($a$)$ Describe a greedy algorithm that finds the optimal schedule of jobs that uses the minimum number of machines. You