3) Give an algorithm to compute the Nth Fibonacci number in Ollg N) time, presuming that arithmetic operations are constant time, and N is a power of 2. (Hint, write F(n) only in terms of F(n-2) and F(n-3), then F(n-3) and F(n-4), and see what kind of pattern emerges.)