A scheduler needs to determine an order in which a set of n processes will be assigned to a processor. The ith process requires ti units of timw and has weight wi. For a given schedule, define the finish time of process i to be the time at which process i is completed by the processor. (Assume that the processor starts processing the tasks at time 0.) Give a greedy algorithm to determine a schedule that minimizes the total weighted nish time. Prove the correctness of your algorithm, and analyze its worst-case running time.