Question 4 12.5 pts Select the best answer. Consider the recurrence relation: T(n) -2.T(n/2)+ 4.n. John guesses that TIn) - 4.n.login). Substituting Tin/2) by the guess in the recurrence relation will yield T(n) Unless specified otherwise, logn) is log base 2. 2.n.log(n/2) 4.n.log(n)-4.n None of these answers O 4.n.log(n/2)+4.n 4.n.log(n/2)-4. D Question 5 12.5 pts Select the best answer. Consider the recurrence relation: T(n) 2.T(n/2) + 4.n. John guesses that T(n) 4.n.log(n).Substituting T(n/2) by the guess in the recurrence relation will lead to T(n) Unless specified otherwise, logn) is log base 2. None of these answers O 4.n.(logn - log2)+4.m 4.nlog(n/2)an 2.n.log(n)+2.n 2.n.log(n)