Incorrect Question 13 0/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, log(n) is log base 2. 2.n.log(n)+2.n 2.n.log(n) None of these answers 4.n.log(n/2)+2.n 4.n.(logn- log2)+4.n