Question $2(10\mathrm{.}0$ marks$)$

Algorithms complexity

Determine the big O running time of the method myMethod$()$ by counting the

approximate number of operations it performs. Show all details of your answer.

Note: the symbol $\%$ represent a modulus operator, that is$,$ the remainder of a

number divided by another number.

$([],)\{$

$0$

$01\{$

$1\{$

$+[]$

$1$

$(<)\{$

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

$=+1$

$\}$

$=2$

$\}$

$\}$

$\}$

$$

$\}$