Suppose we have n jobs labelled 1; : : : ; n. for each job, you have determined the bonus of completing the job, vi 0, a penalty per day that you accumulate for not doing the job, pi 0, and the days required for you to successfully complete the job ri > 0. every day, we choose one unfinished job to work on. a job i has been finished if we have spent ri days working on it. this doesn’t necessarily mean you have to spend ri contiguous sequence of days working on job i. we start on day 1, and we want to complete all our jobs and finish with maximum reward. if we finish job i at the end of day t, we will get reward pi. note, this value can be negative if you choose to delay a job for too long. given this information, what is the optimal job scheduling policy to complete all of the jobs? provide reasons for it’s optimality.