For the following operations, define the best$-$case runtime complexity in terms of n$.$

int n $=3$;

for $($int i $=0$; i $<$ n; i$++)$

$\{$

int j $=1$;

while $($j $<$ n$)$

$\{$

j $*=2$;

System.out.println$($i $+","+$ j$)$;

$\}$

$\}$

Group of answer choices

O$($log n$)$

O$($n$2)$

O$(1)$

O$($n$)$