def search $($L $,$ target $)$:

# L is a list

found $=$ False

i $=0$

while i $<$ len $($ L $)$ and not found :

if L $[$ i $]==$ target :

found $=$ True

i $+=1$

return found

With regard to the function above:

$$ What is its big$-$O time complexity? Very briefly justify your answer.

$$ If you used any variables, such as N$,$ in your time complexity, define them in term of the function$$s

parameters.