What is the smallest integer k such that n \log n is in O(n^k)?

2

n \log n is bigger than n^{1}

So, that means 1 is too small.

But, n \log n is less than n^2

Actually n \log n is less than n^{1+a} even for tiny positive values of a