Barr the bear has started a business to sell fish to poe and his fellow penguins. the penguin customers submit many fish orders, but barr can only process one order at a time. suppose that barr currently has orders from n penguin customers (label them as 1, 2, . . , n). customer i’s order takes ti time to complete. barr is going to process each penguin’s order one by one, and the scheduling of orders can be described as a permutation of the customers. let ci denote the completion time of order i. for instance, if customer j’s order is the first to be completed, then we would have cj = tj (assume barr begins processing orders at time 0); if customer k’s order is the second to be completed after that, then ck = cj + tk = tj + tk, and so on. each customer is of different importance to barr’s business, and we denote this relative weight by wi (for customer i). barr wishes to minimize the weighted sum of the completion times of n orders, pn i=1 wi · ci . intuitively, the more important a customer is, the sooner barr wishes to complete the customer’s order. design an o(n log n) algorithm to solve this problem to barr. you are given a set of n orders with a processing time ti and a weight wi for each customer i (assume ti , wi are positive integers). you want to decide an ordering of the customer orders so as to minimize the weighted sum of the completion times. prove correctness of your algorithm (i. e., optimality) and analyze its runtime.