Consider the following high-level recursive procedure:

long long int f(long long int n, long long int k) { long long int b; b=k+2; if (n==0) b = 8; else b = b + 4 * n + f(n-1,k+1); return b + k; }

Translate the high-level procedure f into ARMv8 assembly language.

Step through your program from the previous question by hand for the case of f(2,4).

What is the final returned value of X2?

Be sure to answer in hex with a leading 0x and all leading 0's removed.