Mode of an array of size $n$ is the most frequently occurring element. For instance, the mode of the array $10,20,30,-10,20,10,10,0,-99,-101,99$ is $10.$ Note that some arrays may have more than one mode. To find a mode, one can use a brute$-$force approach where every element in the array is counted to see how many times it has appeared. Then, an element that has appeared most frequently is the mode. What is the time complexity of this approach? Select the best estimate.

$O(n^2)$

$O(n)$

$O(n^{2}logn)$

$O(nlogn)$