Consider the following pseudocode function. The index of array data starts at $0.$

$//$ precondition: N is the length of the array data

int moat$\_$after $($ int array data, int x $)$

int moat $0$

for $($ int i $0$; i $<$ N; i $$ i $+1)$

int current $0$

for $($ int j $$ i $+1$; j $<$ N; i $$ j $+1)$

if $($ data$[$i$]==$ data$[$j$])$

current $$ current $+1$

end if

end for

if $($ current $>$ moat $)$

moat $$ current

end if

end for

return moat

end moat$\_$after I

f array data has N elements, what is the average running time of function moat$\_$after?

A$.$ O$($N$)$

B$.$ O$($NlogN$)$

C$.$ O$($n$^2)$

O$($n$^3)$