Write a recursive formula for the sequence {10, 12, 14, 16, ...}. (1 point)
O f(1) = 10, f(n) = f(n − 1) + 2, for n > 1
O f(1) = 2, f(n) = f(n − 1) + 10, for n > 1
O f(1) = 10, f(n) = f(n − 1) – 2, for n > 1
O f(1) = 2, f(n) = f(n − 1) – 10, for n > 1

The answer is:O f(1) = 10, f(n) = f(n − 1) + 2, for n > 1

Step-by-step explanation:

f1=10 because the first number is 10. then f(n)=f(n-1)+2 for N because it goes up 2 every time.

you're missing vital information, add to it so we can solve this problem for you.

step-by-step explanation: