For each of the following recurrence relations.

i$)$ Compute the next three values $($i$.$e$.$ beyond the initial conditions$)$ recursively.

ii$)$ Solve the recurrence relation. Check your solution with the recursive computations.

a$)f_n=f_{n-1}+2f_{n-2},f_0=-1,f_1=2$

$)a_n=-13a_{n-1}+8b_{n-1}$

$b_n=-24a_{n-1}+15b_{n-1}$

c$)($optional $10$pts x$/$c$)a_n=-a_{n-1}+3b_{n-1}-6c_{n-1}$

$b_n=a_{n-1}+b_{n-1}-7c_{n-1}$

$c_n=,b_{n-1}-3c_{n-1}$