Consider the routine below which checks whether the element `14` is contained in the input myArray. Determine the run-time complexity of the routine using Big-O notation.
def check_for_value(myArray):
for element in myArray:
if element == 14:
return TRUE
return FALSE
The algorithm as written above has a run-time complexity of
Box 1: Select the best answer