What is the Big$-$O for the maximum number of times that "Found" is printed.

for $($ int $i=2$;$in-1$; $i++)$

if $(O(1)O(lo{g}_{2}n)O(n-1)O(n)O(2^n)a[i]$

System.out.println$($ "Found" $)$;

$O(1)$

$O(lo{g}_{2}n)$

$O(n-1)$

$O(n)$

$O(2^n)$