Incorrect Question 12 0/5 pts Provide a numerical answer. Consider the following recurrence relation: T(n) = \c if n =1, if n >1, | 2T (n/2) + cn When developing the recurrence tree, the number of levels of the tree from the root to the leaves "T(1)" is equal to assuming that nis a power of 2 and c = 5. None of these answers n.log(n) (log base 2) 5.n On log(n) (log base 2)