The Fibonacci number sequence {$$F_N$$} is defined as: $$F_0=0$$

The Fibonacci number sequence {$$F_N$$} is defined as: $$F_0=0$$, $$F_1=1$$, $$F_N=F_{N-1}+F_{N-2}$$, $$N$$=2, 3, .... The space complexity of the function which calculates $$F_N$$ recursively is $$O(N)$$。 ~@[](3)

答案：TRUE