n the following graph of Big O which algorithm has the best performance for n $>15?$

Question $7$ options:

$2$n

$5$ n$2$

$100$n

$400$ logn

$1/2$ n$3$