Analyse the complexity of Algorithm $1.$

Assuming $n$ and FIB$(n)$ both fit in an integer, devise an algorithm

that uses an array of no more than two integers to "efficiently"

compute Fib$(n).$

$[1$ point$]$

What is the complexity of your algorithm. Justify your answer. $[\mathrm{.}5$

points$]$