(Solved): 7) Consider the sequence of numbers where each number in the sequence is obtained as a sum of two n ...

7) Consider the sequence of numbers where each number in the sequence is obtained as a sum of two numbers: - predecessor of a predecessor, and - 2 times the predecessor while seed numbers are \( F_{0}=0 \) and \( F_{1}=1 \). a) Find the recursive algorithm for the given sequence of numbers. points) b) Find the matrix equation for the general term \( \left(F_{n}\right) \) of the sequence. points) c) Find the \( 23^{r d} \) term of the sequence. (24 points)