The space complexity for finding nth fibonacci number using recursion is :

Options
O(n) 
O(2^n)
O(log n)
O(n^2)
O(nlogn)


O(n) 
