Below is an algorithm which computes d" where d is a constant and n is www a whole number such that n 0: Algorithm 2 int recAlg(int n, int d) 1: if (n = 0 ) then 2: return 1; 3: else if (n = 1) then return d; 4: 5: end if 6: return d * d * recAlg(n - 2, d); rowobaridy Prove that recAlg(n, d) = d using strong induction. (a) (2 points) Base cases: (b) Recursive case: i. (2 points) What are you assuming is true: ii. (2 points) What are you proving is true: iii. (3 points) Complete the proof: