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

A

$.$

$$O

$($

log n

$)$

B

$.$

$$O

$($

n

$2$

$)$

C

$.$

$$O

$($

$1$

$)$

D

$.$

$$O

$($

n

$)$