Determine the big O complexity for the following function, which represents the number of steps required for some algorithm:

$O(n**log(n))$

$O(log(n^{15}))$

$O(n)$

$O(n^2)$

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