Question 3. Suppose a vending machine accepts 1-dollar, 2-dollar, and 5-dollar coins. How many ways could you enter in dollars into the machine (assume that the order that the coins are entered matters). For example, if we want to enter 3 dollars, we can do it. in three ways: (111,1), (1,2) or (2,1). If we want to enter 5 dollars, we can do it. as follows: (5), (1,1.1,1,1), (2,1,1,l), (1,2,l,1), , (1,1,2,l), (1,1,l,2), (2,2,1), (2,12), (12.2). Writing the recursion sufces