Question 1131897
<br>
f(0)=2; for n >= 0, f(n+1) = -2*f(n)+3.<br>
Set n = 0 in the recursive definition to find f(1):
n=0:  f(1) = -2*f(0)+3 = -2(2)+3 = -4+3 = -1<br>
Set n = 1 in the recursive definition to find f(2):
n=1:  f(2) = -2*f(1)+3 = -2(-1)+3 = 2+3 = 5<br>
ANSWER: f(2) = 5