Question 6 10 pts Recall the following algorithm, which determines the Fibonacci value of some number n: int fib(int n)

[answerhappygod]

Question 6 10 Pts Recall The Following Algorithm Which Determines The Fibonacci Value Of Some Number N Int Fib Int N 1 (35.88 KiB) Viewed 23 times

Question 6 10 pts Recall the following algorithm, which determines the Fibonacci value of some number n: int fib(int n) { if (n <= 1) return n; else return fib(n - 1) + fib(n - 2); } Explain why this solution is not recommended for use by performing a simple recursive trace of Fib(5) and Fib(6), as well as state the Big Oh complexity of this algorithm.