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

if$($arr$[$i$]==$ target$)\{$

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

break;

$\}$

$\}$

What is the time complexity of this code snippet?

Note $^$ means raised to the power. For example n$^3$ means n cubed.

Question $31$ options:

O$($n$)$

O$($n$^2)$

O$(1)$

O$($log n$)$