Please answer all parts of the question within the image.

Q33. The below code shows the recursive squaring of Fibonacci numbers. Analyze the time complexity of the below powering code as the divide and conquer approach with T(n)=aT(n/b) + 0(1). Prove what T(n) is by the master theorem through identifying the case of the below code with a and b: .. # Create an array for memoization f. [0] . MAX # Returns n'th fuibonacci number using table f[] def fib(n) : # Base cases if ( ne): return @ if (n == 1 or n == 2): f[n) - 1 return (f[n]) # If fib(n) is already computed if (f[n]): return f[n] if(n & 1) : k. (n + 1) // 2 else: ken // 2 + Applying above formula [Note value n&1 is 1 # if n is odd, else e. if((n & 1) ) : f[n] = (fib(k) * fib(k) + fib (k-1) * fib(k-1)) f[n] = (2*fib(k-1) + fib(k))*fib(k) return f[n] : else: # Driver code print(fib(n))