What is the complexity of the given code as a function of the problem size n$?$ very important to show details of your analysis.

for $($int i $=1$;i$<mi></mi>$; i$++)\{$

if $($i $\%2==0)\{$

for $($int j $=1$; j n; j $*=2)\{$

$//$ constant work O$(1)$

$\}$

$\}$ else $\{$

$//$ constant work O$(1)$

$\}$

$\}$