Consider the following functions, f$($n$)=$ n$($log n$)$

$2$ and g$($n$)=$ n

$1\mathrm{.}5.$ Which grows more

quickly? $($That is$,$ which would be a $$worse$$ time$-$complexity.$)$ Express your answer in

terms of one of the order$-$classes we$$ve studied, i$.$e$.$ something in a form like f$($n$)=\backslash$Theta $($g$($n$))$

but with something other than Big$-$Theta. Explain your answer with a short proof; you may

use any definitions from the course slides