What is the time complexity of an algorithm that performs better than $O(nlogn)$ but worse than $O(n)$ for large input sizes $n?$

$O(n^{\frac{3}{2}})$

$O(n^2)$

$O(\sqrt[\phantom{2}]{n})$

$O(loglogn)$

$O(logn)$

$0(nloglogn)$