判断题：The $$n$$-th Fibonacci number can be computed by divide and conq

The $$n$$-th Fibonacci number can be computed by divide and conquer method of computing $$x^n$$, where $$x$$ is the matrix 
$$\left( 
\begin{array}{l}
  0 & 1 \\
  1 & 1  
\end{array}
\right)$$.

Then the $$n^2$$-th Fibonacci number $$F_{n^2}$$ can be computed in $$O(\log n)$$ time. 

答案：TRUE