(a) Consider designing an algorithm for issuing coins from a vending machine. This algorithm should take in an amount of change needed x and issues the minimum number of coins whose value sums to r. Given an ordered set of coin denominations, C = {ci, C2,...}, a typical greedy approach is to choose the largest coin ck such that ck