According to  Introduction to algorithms by Cormen et al,$$T(n)=2T(n/2)+n\log n$$ is not case 3 of Master Theorem. Can someone explain me why?And which case of master theorem is it?
$T(n)=2T(n/2)+n\log n$ and the Master theorem
algorithms;algorithm analysis;master theorem