LAST DGT 1 2

Q4. (26 pts) A recursive power program is given below. int powa(int x, int n){ if (n=1){ return x; \}else return x * powa( (x,n1); void main 0\{ int val; val = powa(2,3); \} The contents of stack before the call of powa(2,3) in main and after 1 recursive call is given below: a) Show the contents of the stack after each recursive call until you reach the base case. b) Show the contents of the stack after each return until you reach back to the main function