Q:

nlogn vs square root of n , Isn't square root slower?

I was doing this quiz on an online course and one question stated;
The function nlogn + √n + 5 may set to belong to
A:  nlogn
B:  √n
C:  n√n
The quiz said the correct answer is A, but isn't square root of n slower? I am new to finding the time complexity of an algorithm and could use an explanation. Or let me know if the answer is wrong.

A:

You should consider n to be an extremely large number. For any n>2, n>√n and logn>1. Thus, nlogn>√n.

