Describe a constant-time algorithm, an improvement of the Cashiers algorithm, that, given an input of m dollars, returns q (quarters), d (dimes), n (nickels) and p (pennies) to give change with the fewest coins. You may assume (somewhat unrealistically) that you can do standard arithmetic operations on any size numbers in O(1) time. Also, assume there is no $1 denomination (i.e., the largest coin returned is a quarter).