What is the worst$-$case order of complexity for an algorithm that does the following: Finding the first occurrence of a given target in an integer array.

Question $2$Select one:

a$.$

O$($n$)$

b$.$

O$($log n$)$

c$.$

O$($n log n$)$

d$.$

O$($n$2)$