The acme turbo-encabulator machine. you are given a list of jobs that can be run on your acme turbo- encabulator machine. each job starts at a certain time and ends at certain time. in addition, by running a job, you earn a certain amount of money. from the given list, you want to run as many jobs as possible so as to maximize the amount of money you earn. however, because you bought the most basic turbo-encabulator model (instead of the deluxe model), you are only able to run one job at a time on the machine. that means if the scheduled running times of two jobs overlap, you cannot run them both. your task is to design an algorithm that takes as input a list of jobs, and outputs the set of jobs that will maximize your earnings, subject to the constraint that you are only able to run one job at a time. assume that the input consists of n jobs, where for j = n, the description of the jth job is the triple (sj, fj, ej), where s; is the start time of the job, fi is the finishing time of the job, and e; the the amount of money you earn by running the job. show how to efficiently solve this problem using dynamic programming. you only need to give an algorithm that computes the optimal earnings, and not an optimal set of jobs itself. your algorithm should run in time o( hints: first, sort the jobs by increasing finishing time; second, for each job j, compute p[] as the largest index i