A bus driver pays all tolls, using only nickels and dimes, by throwing one coin at a time into the mechanical toll collector.
- Find a recurrence relation for the number of different ways the bus driver can pay a toll of $n$ cents (where the order in which the coins are used matters).
- In how many different ways can the driver pay a toll of $45$ cents?
