3. 10 marks] Suppose we would like to buy n items from SuperCheapStore (SCS); all items are currently priced at 1 CAD. Unfortunately there is no delivery and we have to deliver them home. The bad news are: we can fit only 1 item in our truck it takes one day to drive home and back There is even worse news SCS charges us for the storage of undelivered items and the charge for storage of item i growth exponentially as original price times factor c, >1 each day. It means that if item i is picked up d days from now, the charge will be 1 CAD In which order should we pick up our items from SCS so that total amount of charges is as small as possible. Develop a greedy algorithm to solve this problem assuming that q c for i j. Prove that your algorithm gives an optimal solution. What is the running time of your algorithm