What is the time complexity of the following function?

def find$\_$first$\_$odd$($num$\_$list$)$:

$\text{'}\text{'}\text{'}$

returns the first item in num$\_$list that is an odd number

if no odd numbers found, returns None

num$\_$list is a list of integers

$\text{'}\text{'}\text{'}$

for num in num$\_$list:

if num$\%2==1$:

return num

print$("$No odd numbers found."$)$

return None

Group of answer choices

O$($log n$)$

O$($n$/2)$

O$($n$)$

O$($n$^2)$