We are going over the master theorem in my algorithms class, and for one problem, I'm trying to compare nlogn vs 1 to figure out which case of the MT it falls under. But I'm having a hard timing figuring out which is bigger.

Edit: This is for solving a recurrence problem. The equation is T(n) = 2T(n/4) + N\*LogN. Just threw this in incase it helps.