$\backslash$item$\{($c$)\}$ Finally, give the asymptotic value of $g$($n$)$$ using the $$\backslash$Theta$$-$notation.

$\backslash$end$\{$description$\}$

oindent

Show your work and include justification for each step.

$\backslash$begin$\{$tabbing$\}$

aa $\backslash =$ aa $\backslash =$ aa $\backslash =$ aa $\backslash =$ aa $\backslash =$ aa $\backslash =\backslash$kill

$\backslash$textbf$\{$Algorithm$\}\backslash$textsc$\{$LotsOfXs$\}$ $$($n: $\backslash$mbox$\{\backslash$bf integer$\})$$ $\backslash \backslash$

$\backslash >\backslash$textbf$\{$for$\}$ $j $\backslash$leftarrow $1$$ $\backslash$textbf$\{$to$\}$ $$2$n$+3$$ $\backslash$textbf$\{$do$\}\backslash \backslash$

$\backslash >\backslash >\backslash$textbf$\{$for$\}$ $k $\backslash$leftarrow $1$$ $\backslash$textbf$\{$to$\}$ $$2$j$ $\backslash$textbf$\{$do$\}$ print$(``$X$")\backslash \backslash$

$\backslash >\backslash$textbf$\{$for$\}$ $j $\backslash$leftarrow $1$$ $\backslash$textbf$\{$to$\}$ $n$

$\backslash$textbf$\{$do$\}\backslash \backslash$

$\backslash >\backslash >\backslash$textbf$\{$for$\}$ $k $\backslash$leftarrow $1$$ $\backslash$textbf$\{$to$\}$ $j$^2$$ $\backslash$textbf$\{$do$\}$ print$(``$X$")$

$\backslash$end$\{$tabbing$\}$