Can you explain these problems, please. Its for an algorithms class.

2. (15 pts) Recall that any recurrence of the form T(n)=aT(n/b)+O(n), where a, b and care all positive values and b>1, has the following solution: T(n) = O(nlogna) if nlogna > c. T(n) = O(n) if nlogba