There are n customers who are waiting for a service. Each customer's service time is known in advance: it is ti minutes for ith customer. So if, for example, the customers are served in order of increasing i, then the i th customer has to wait for tj minutes. We want to minimize the total waiting time L T=(timespentbycustomeri). Design an algorithm that works in polynomial of n time that returns the optimal order in which to process the customers