True$/$False choice. Explain the reasoning behind your answer for each statement. $($Asymptotic Upper Bound from Analysis of Algorithms$)$

$1)$ nlog n $=$ O$($n$)$

$2)$ nlogn $=$ O$($n$)$

$3)16$n $=2$O$($n$)$

$4)$ n$$n $=$O$($nlogn$)$

$5)$ loglogn $=$ O$($logn$)$

$6)$ log$2$ n $=$ O$($logn$)$