What is the space complexity of the recursive implementation used to find the nth fibonacci term? O(1)O(n) O(n2) O(n3)

What is the time complexity of this function / algorithm?int Fibonacci(int number){ if (number <= 1) return number; return Fibonacci(number - 2) + Fibonacci(number - 1);}O(n)O(1)O(log(n))O(nlog(n))O(2^n)O(n!)O(n^2)

Consider the recursive implementation to find the nth fibonacci number:int fibo(int n) if n <= 1 return n return __________ Which line would make the implementation complete?  fibo(n) + fibo(n) fibo(n) + fibo(n – 1)  fibo(n – 1) + fibo(n + 1) fibo(n – 1) + fibo(n – 2)

Suppose we find the 8th term using the recursive implementation. The arguments passed to the function calls will be as follows: fibonacci(8)fibonacci(7) + fibonacci(6)fibonacci(6) + fibonacci(5) + fibonacci(5) + fibonacci(4)fibonacci(5) + fibonacci(4) + fibonacci(4) + fibonacci(3) + fibonacci(4)+ fibonacci(3) + fibonacci(3) + fibonacci(2)::: Which property is shown by the above function calls? Memoization Optimal substructure Overlapping subproblems Greedy

The following sequence is a fibonacci sequence:0, 1, 1, 2, 3, 5, 8, 13, 21,…..Which technique can be used to get the nth fibonacci term? Recursion Dynamic programming  A single for loop  Recursion, Dynamic Programming, For loops

For computing Fibonacci numbers, the naive recursive algorithm takes time which in the worst-case is a.Linear b.Quadraticc.Logarithmicd.Exponential