Consider the following C function: void question(int n) { if(n>0){ question(i-4); } printf("!"); if(n>1) { question(i/2); } } Trace the execution of this function when it is called for n=4, i.e. to calculate exclamation(int n), and determine what the function outputs. After analysing its code, an algorithm is found to satisfy the following recurrence relation defined in terms of the input size N: For any N 2 0, (N) = T(N/2) + N2 Solve the recurrence relation by expanding it until you reach the base case for N = 0, and then express the computation complexity of the function as a function of N using Big-Oh notation