What is the Tilde approximation order of the following code fragment? The fragment is parameterized on the variable $n.$ Assume that you are measuring the number of printin calls, and that the time to use$/$create Random is negligible.

Random rand $=$ new Random$()$;

for $($int $i=1$;$in$; it$+)$

for $($int $j=1$;$jn$;$j**=2)$

if $(j>$ rand.nextInt $(\frac{n}{2}))$

System.out.println$("$Nested loops!"$)$; $//$count these

Does not exist $($or cannot be determined with information given$).$

$nlogn$

$n^{{?}^{{?}^{?}}}2$

$(\frac{1}{2})n^{{?}^{{?}^{?}}}2$