Consider a job scheduling problem where each job Ji has a start and a finish time (si , fi). Two…

Consider a job scheduling problem where each job Ji has a start and a finish time (si , fi). Two jobs cannot run simultaneously and once started, a job must run to its completion (i.e., we cannot split a job into parts). Given a set of jobs, (i) If we schedule greedily in increasing order of finish times, can we maximize the number of jobs completed? Justify. (ii) If job Ji is associated with a profit pi (_ 0), can you apply a greedy algorithm to maximize the profit (of all completed jobs)? Justify.