Compute the big O time complexity $($worst case$)$ of the following code. Show all

your work to get credit, including a table of steps to n $($as seen in class$),$ and then

all the summations and all your work to compute the time complexity.

x $=0$;

for $($i$=1$; i$<=$n; i$=$i$*3)\{$

print$("...")$

if $($x $>0)\{$

print$("...")$

for $($j$=1$; $$j$<=$n; j$++)\{$

print$("...")$

$\}$

$\}$

for $($k$=2$; k