(10%) Use the master method to give tight asymptotic bounds for the following recursive $T(n) = 27T(n/3) + \Theta(n^3/\lg n)$. (Assume that $T(n)$ is a constant for sufficiently small $n$.)