psuedo code only please

Problem 3 Consider the problem of scheduling a set of jobs so as to minimize the total weighted completion time. There are n jobs indexed by [n] := {1, 2, 3, ... ,n}, and each job je [n] has a weight w; > 0 and processing time P; > 0. The goal of the problem is to output an ordering of jobs so as to minimize the total weighted completion time of all jobs. See Figure 1 for an instance of the problem. P1 = 1 P2 = 2 P3 = 3 1 2 3 w = 2 W2 = 5 W3 = 7 wi = 2 W2 = 5 W3 = 7 W2 = 5 W3 = 7 w1 = 2 1 2 3 2 3 1 0 1 2 3 4 5 6 0 1 2 3 4 5 6 cost = 2x1+5 x 3 + 7 x 6 = 59 cost = 5 x 2 + 7 x 5 + 2 x 6 = 57 Figure 1: An instance with two different schedules. The second schedule has a better weighted completion time than the first one, and it is the optimum schedule. Problem 3 Consider the problem of scheduling a set of jobs so as to minimize the total weighted completion time. There are n jobs indexed by [n] := {1, 2, 3, ... ,n}, and each job je [n] has a weight w; > 0 and processing time P; > 0. The goal of the problem is to output an ordering of jobs so as to minimize the total weighted completion time of all jobs. See Figure 1 for an instance of the problem. P1 = 1 P2 = 2 P3 = 3 1 2 3 w = 2 W2 = 5 W3 = 7 wi = 2 W2 = 5 W3 = 7 W2 = 5 W3 = 7 w1 = 2 1 2 3 2 3 1 0 1 2 3 4 5 6 0 1 2 3 4 5 6 cost = 2x1+5 x 3 + 7 x 6 = 59 cost = 5 x 2 + 7 x 5 + 2 x 6 = 57 Figure 1: An instance with two different schedules. The second schedule has a better weighted completion time than the first one, and it is the optimum schedule