2. Recursive Program (5 points) Consider the following recursive function for n > 0: Algorithm 1 int recFunc(int n) //Base Case: if n == 0 then return 1; end if if n == 1 then return 2; end if //Recursive Case: int a=0 int j = recFunc(n/2) while j > 0 do print("Simulating Trammel of Archimedes..."); a= a +recFuncn/2); j=j-1; end while return a; (1) Use strong induction to prove the value returned by recFunc(n) is