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

Please be aware that there will be point deductions for incorrect answers.

O$($sqrt$($n$))$

O$(loglogn$

O$($n $loglogn$

$O(logn)$

$O(n^2)$

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