By examining the recursion tree for computing fibonacci, we can deduce an exponential $0(2^n)$ complexity, with potential for speedups by using $q,$

Pick ONE option

$$

$$

Solve question $5$

intermediate results

$$