I have calculated the running time but I am not sure if I am right. Please help to check if the Big O running time complexity derived is correct. Thank you! Question $2(10\mathrm{.}0$ marks$)$ 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. $-$ static int myMethod$($A$[],$n$)\{$ count$+0$ fori $-0$ ton $-1\{$ for j $-$ iton $-1\{$ count $+$ count$+$ A$[]$ k $+1$ while $($k $<$ n$2)\{$ if $($j$\%2=0)\{$ count $=$ count $+1\}$ k $++\}\}$ return count $\}\}1$ n n$2$ n $2-1$ b n $2+1$ n$2$ n $2$ln $2)==$ n$21$ therefore, running time complexity: $0$ in $4)$