a bus driver pays all tolls, using only nickels and dimes, by throwing one coin at a time into the mechanical toll collector. a) find a recurrence relation for the number of different ways the driver can pay a toll of n cents