Express the solution to the recursion nt+1 = ant in terms of the eigenvectors and eigenvalues of a. use de moivre’s theorem to simplify the solution, if appropriate.
a=
[a -1
1 -a]
and n0 =
[1
0], where a is a real number.