What is the Big$-$Oh order of the following code fragment? The fragment is parameterized on the variable $n.$ Assume that you are measuring the number of println calls and that $n$ is at least $2.$ You should provide a relatively tight upper bound.

for $($int $j=n$;$j>2$;$jl=2k=10$;$k<mn\; id="EditorElement\_1534460">1</mn><mn\; id="EditorElement\_1534461">0</mn><mn\; id="EditorElement\_1534462">0</mn>$;$k**=2O(n^{{?}^{{?}^{?}}}2)0(n^{{?}^{{?}^{?}}}2***logn)O(n^{{?}^{{?}^{?}}}3)i=1$;$i$