Please do all

e. Show the Fibonacci sequence: 0, 1, 1, 2, 3,5,8,11... as a function of n: f(n), which is a summation of two reduced functions: i. f(n) = f(?) + f (?) ....... (1) [Points: 2] ii. Trace equation (1) above as a tree for n = 8 as shown below: [Points: 5] i iii. What inefficiency do you detect in the above tracing when you implement the algorithm shown in equation (1) with recursive calls without any code optimization? [Points: 2]