Master theorem: $T(n)=10T(n/9)+nlg(n)$

I am told to solve the recurrence
$$T(n)=10T(n/9)+nlg(n)$$
using the Master theorem. I then try to use case 3. However, I am unable to show that for $f(n)=nlg(n)$ then $10f(n/9) leq cnlg(n)$ for $c < 1$ and all sufficiently large $n$. Is it wrong to use case 3? Or does the Master theorem even apply?