The code segment below prints some of the elements in an array with size $n.$ Select an expression to complete the code segment so that the resulting algorithm has $O(logn)$ running time.

for

$\{$

System.out. println$($array $[j]$

$\}$

$($int $j=0$; $j$ array. length $j=j+2)$

$($int $j=0$; j $$ array. length $/2$; j$++)$

$($int $j=1$; j $$ array. length; $j=j*2)$

$($int $j=0$; j $$ array.length; j$++)$