Method Analysis. Determine the Big$-$O runtime of the following method.

Show the contents of numbers after calling bar$()$ if it initially contained $\{2,3,4\}.$

Show the contents of numbers after calling bar$()$ if it initially contained $\{1,2,3\}.$

Is the Big$-$O runtime affected by the length of numbers, the values it contains, or both?

public void bar$($int$[]$ numbers$)\{$

for $($int idx$1=$ numbers.length $-1$; idx$1>=0$; idx$1--)\{$

for $($int idx$2=0$; idx$2<$ idx$1$; idx$2++)\{$

if $($numbers$[$idx$1]\%2==0)\{$

int tmp $=$ numbers$[$idx$2]$;

numbers$[$idx$2]=$ numbers$[$idx$2+1]$;

numbers$[$idx$2+1]=$ tmp;