Consider the following function:

int f(int n)

{

int sum = 0;

if(n == 2)

return 2;

for(int i=1; i<=n*n; i=i*2)

sum = sum + i;

return f(n/2);

}

a. Find the recurrence relation

b. Solve the recurrence relation by using the substitution method

PS: the answer is already available but I need a detailed and accurate answer.