If an algorithm$$s time complexity is O$($n log n$),$ which of the following statements is true as n increases?

a$)$ The algorithm will perform better than O$($n$^2).$

b$)$ The algorithm will perform worse than O$($n$).$

c$)$ Both a and b are correct.

d$)$ None of the above.