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) = 4 f(1) = 2 f(n) = f(n-1) + 4 for n ≥ 2 f(n) = -3f(n-1) for n ≥ 2 - f(1) = 3 f(1) = 2 f(n)=3f(n-1) for n ≥ 2 f(n)=2f(n-1) for n ≥ 2 f(1) = 4 f(1) = 3 f(n) = f(n-1) + 2 for n ≥ 2 f(n) = f(n-1) + 2 for n ≥ 2 Sequence 3, 6, 12, 24, ... 2, -6, 18, -54, ... 4, 8, 12, 16, ... Recursively Defined Function
