Note you need to prove your algorithm is indeed optimal. ?

A small business say, a photocopying service with a single large machine -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 r_i time to complete. Given a schedule (i.e., an ordering of the jobs), let C_i denote the finishing time of job i. For example, if job j is the first to be done, we would have C_j = t_j; and if job j is done right after job i, we would have C_j = C_j - t_i, Each customer i also has a given weight w_1 that represents his or her importance to the business. 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 weighted sum of the completion limes. sigma_i = 1^n w_1 C_1. Design an efficient algorithm to solve this problem. That is. you are-given a set of n jobs with a processing time r_i and a weight w_i for each job. You want to order the jobs so as to minimize the weighted sum of the completion times, sigma_i = 1^n w_i C_i. Example. Suppose there are two jobs: the first takes time t_1 = 1 and has weight w_1 = 10, while the second job takes time t_2 = 3 and has weight w_2 = 2. Then doing job 1 first would yield a weighted completion time of 10 middot 1 + 2 middot 4 = 16, while doing the second job first would yield the larger weighted completion lime of 10 middot 4 + 2 middot 3 = 46