Fibonacci numbers in closed form

The Fibonacci numbers satisfy $F_0 = 0$, $F_1 = 1$ and $F_{n+1} = F_n + F_{n-1}$. Use linear algebra to find a closed form for $F_n$. Then explain how to compute $F_n$ exactly using $O(\log n)$ arithmetic operations.