Drag the tiles to the correct boxes to complete the pairs. not all tiles will be used. match each sequence to its appropriate recursively defined function. f(1) = -18 f(n) = 6 · f(n - 1) for n = 2, 3, 4, f(1) = -18 f(n) = f(n - 1) + 21 for n = 2, 3, 4, f(1) = 11 f(n) = f(n - 1) + 22 for n = 2, 3, 4, f(1) = 11 f(n) = 3 · f(n - 1) for n = 2, 3, 4, f(1) = -18 f(n) = f(n - 1) + 22 for n = 2, 3, 4, f(1) = -18 f(n) = 2 · f(n - 1) for n = 2, 3, 4, sequence recursively defined function 11, 33, 55, 77, arrowboth -18, -108, -648, -3,888, arrowboth -18, 3, 24, 45, arrowboth

  see below

Step-by-step explanation:

Since there are fewer sequences than functions, we'll identify the matchup according to the sequence.

11, 33, 55, 77, ...

The first term is 11. The terms have a common difference of 33 -11 = 22. That is, each term is 22 more than the previous one. The appropriate recursive function is ...

__

-18, -108, -648, -3888, ...

The first term is -18. The terms obviously do not have a common difference, but their common ratio is -648/-108 = -108/-18 = 6. That is, each term is 6 times the previous one. Then the appropriate recursive function is ...

__

-18, 3, 24, 45, ...

The first term is -18. The terms have a common difference of 3-(-18) = 21. That is, each term is 21 more than the previous one. The appropriate recursive function is ...

boxplot

answer: 4 (:

step-by-step explanation: