If a sequence is defined recursively by f(0)=2 and f(n+1)=-2f(n)+3 for n≥0, then f(2) is equal to? (1)1 (2)-11 (3)5 (4)17
f(0) = 2
f(0 + 1) = f(1) = -2f(n) + 3 = -2f(0) + 3 = -2(2) + 3 = -1
So
f(1 + 1) = f(2) = -2f(n) + 3 = -2f(1) + 3 = -2(-1) + 3 = 5
