How many array accesses are there in the code snippet below?

int count $=0$;

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

for $($int j $=$ i$+1$; j $<$ n; j$++)\{$

if $($a$[$i$]+$ a$[$j$]==0)\{$

count$++$;

$\}$

$\}$

$\}$

Group of answer choices

$1/2$ n $($n $-1)$

n $($n $-1)$

$2$ n$^2$

$2$ n $($n $-1)$