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.

step-by-step explanation:

for volume, add base x height x width

it's 100

step-by-step explanation:

22, 28, 34, 40, 46

b)   f(n) = 6n + 16

  n = what is the number of the row ( 22 would be row 1) so if we replaced n with 1, we would get 22

c)   the  14th  row will have 100 seats

(1)   (2)   (3)   (4)   (5)   (6)   (7)   (8)   (9)   (10) (11) (12) (13) (14)

22 | 28 | 34 | 40 | 46 | 52 | 58 | 64 | 70 | 76 | 82 | 88 | 94 | 100

read more on -