i just send this question to an expert but the answer from two expert is totally different, one is O$($nlogn$),$ one is O$($n$^2$ logbase$2$n$)$ what is the correct answer? Can u please help me to write down the number of operation step by step? Like beside every lines, please help to explain also, because i am really weak at this lesson. Thanks!Determine the big O running time of the method myMethod$($int n$)$ by counting the approximate number of operations it performs. Show all details of your answer.

Static void doIt $($int n$)\{$

int i

int j $(2\backslash$times n$)$

loop while $($ j $>0)$

i $$ n

loop while $($ i $>=1)\{$ i $$ i $/2\}$

j $$ j $1\}\}$

Static int myMethod $($int n$)$

$\{$ sum $0$

for i $1$ to n $\{$

sum $=$ sum $+$ doIt$($i$)\}$ return $1)$