What are the worst case and average case complexity, respectively, of the loadUp function? $("$rand$.$nextInt$($k$)"$ generates a random number in the range $0..$k$-1$ and runs in O$(1)$ time$).$

Random rand $=$ new Random$()$;

$...$

ArrayList loadUp$($int n$)\{$

ArrayList v $=$ new ArrayList$<>()$;

for $($int i $=0$; i $<$ n; $++$i$)$

$\{$

if $($rand$.$nextInt$(2)==0)$

for $($int j $=0$; j $<$ n; $++$j$)$

v$.$add$($rand$.$nextInt$($n$))$;

$\}$

return v;

$\}$

Group of answer choices

worst: O$($n$),$ average: O$($n$)$

worst: O$($n$),$ average: O$($n$2)$

worst: O$($n$2),$ average: O$($n$)$

worst: O$($n$2),$ average: O$($n$2)$

worst: O$($n$3),$ average: O$($n$2)$

None of the other answers are correct