Suppose you own a company that must license software modules. Since your company has only a limited amount of money to spend each month, you can only purchase one license per month. The costs of the software licenses are all different and are given by P1, ... ,Pn. Unfortunately the cost of all the licenses goes up by a factor of r (r is > 1) each month. Thus the price of a license for the ith product is p: * after m months. Design an n log n algorithm to find what order to purchase the licenses to minimize the total cost to the company, that is, it will find the least overall cost solution to buying all the software modules. Specify the algorithm with pseudo code. What is the efficiency of your algorithm? A. Specify an efficient greedy algorithm to achieve this goal with the fewest cell towers. B. Prove your algorithm always finds the optimal solution. C. Analyze your algorithm's complexity.