Answer Q2. I already know the answer to Q1 is E. I want to understand how to derive the answer for Q2.

Remark: In questions 1-4 below we assume that T(n)=c for nd, for some constants c and d. The following two questions 1-2 are about the following recurrence relation T(n)=16T(n/4)+n3 We use the Master Method with a=16,b=4, so logba=log416=2. Hence nlogba=n2. Now we have that f(n)=n3=(n2+) with, for instance, =0.5. 1. [4 marks] Which calculation is then correct: A. Then, af(n/b)=16f(n/4)=16(n/4)3=4316f(n)=f(n), so we are in Case 1 of the Master Method with =4316=41