Q36,paper3 ,d13. The recurrence relation T(n)=mT(n/2)tan^2 is satisfied by

(A)    O(n²)

 (B) O(n1g m)

(C) O(n² lg n)

(D) O(n 1g n)

Explanation 

Master Method is a direct way to get the solution. The master method works only for following type of recurrences 

T(n) = aT(n/b) + f(n) 

highest degree of f(n) is c.

There are following three cases:
T(n)= O(_nc) where a<b^c                       eq 1.

T(n)= O(_nc log n) where b^c=a. eq 2.

T(n)=O(_nlog_ba) where a> b^c.             eq 3

In our case

T(n)=mT(n/2)tan²

value of a is m, not known.  so we cannot say  a= 2^C OR NOT  . WE CAN NOT SAY WHICH EQUATION WILL FOLLOW.