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) = 13
f(n) = f(n-1) + 26 for n > _2

f(1) = -24
f(n) = 4 • f(n-1) for n > _2

(1) = 28
f(n) = f(n-1) - 84 for n > _2

f(1) = 13
f(n) = 3. f(n-1) for n > _2

(1) = 28
f(n) = -4. f(n-1) for n > _2

f(1) = -24
f(n) = 4 .f(n- 1) for n > _2

sequence
13, 39, 65,

-24,-96,-384, -1,

28, -112, 448,-1,792,

1. There are two possible answer that have f(1)=13. The trick to narrow it down is by looking at the pattern. Is the increase constant or at an increasing rate?

f(1) = 13

f(n) = f(n-1) + 26 for n >_2

2. Again there are two possible answers. The trick here is seeing that the pattern stays negative and does not undulate from positive to negative. So the multiplier has to be positive.

f(1) = -24

f(n) = 4 .f(n- 1) for n >_2

3. This one undulates so the answer is...

f(1) = 28

f(n) = -4. f(n-1) for n >_2

answer: apothems is your answer

step-by-step explanation: hope u get it right

need more detail

step-by-step explanation:

lele