There are 5 routes that lead from City A to City B, 7 routes that link City B to City C, and 3 routes that link City C to City D. How many different routes lead from City A to City D?

the first one

step-by-step explanation:

just id the test.

answer: idk wbu

step-by-step explanation: umm..

an = 22 + (n-1) *6

110 seats

step-by-step explanation:

an=a1+(n-1)(d)

a1 = 22   this is the first item in the sequence

d =6   this is how the sequence goes up

a)   an = 22 + (n-1) *6

b) a12 = 22 + (12-1) *6

    a12 = 22+11*6

  a12 = 22 +88

  a12 = 110