I only need the solution for answer (b)

6. Consider the following algorithm. ALGORITHM Enigma(A[O..n-1,0.n -1) //Input: A matrix A[0.. 1,0.n 1 of real numbers fori0 to n 2 do for ji1 to n 1 do return false return true (Answer a, b) wAnsver questions a-e of Problem 4 about this algorithm. 7. a. Design a recursive algorithm for computing 2" for any nonnegative integer n which is based on the formula: 2 22-1 b. Set up a recurrence relation for the number of additions made by the algorithm and solve it