Problem 2: A small business faces the following scheduling problem. Each morning they get a set of jobs from customers. They want to do the jobs on their single machine in an order that keeps their customers happiest. Customer i's job will take ti time to complete. Given a schedule (i.e., an ordering of the jobs), let Ci denote the finishing time of job i. For example, if job j is the first to be done, we would have Ci-tj; and if job j is done right after job i, we would have Cj G-tj. The happiness of customer i is expected to be dependent on the finishing time of i's job. So the company decides that they want to order the jobs to minimize the sum of the completion times Design an efficient algorithm to solve this problem. That is, you are given a set of n jobs with a processing time t, for each job. You want to order the jobs so as to minimize the weighted sum of the completion times, G