bug theta notation for$($int i$=1$; i $<=$ n; i$++)\{$

for$($int k$=1$; k $<=$ n; k$++)\{$

if$($ A$[$k$]==$ i$)\{$

for$($int m$=1$; m $<=$ n; m$=$m$+$m$)\{$

$//$ do something that takes O$(1)$ time

$//$ Assume the contents of the A$[]$ array are not changed

$\}$

$\}$

$\}$

$\}$