Consider the routine below which checks whether the input myArray contains at least one duplicated value. Determine the run-time complexity of the routine using Big-O notation.

def check_for_duplicate(myArray):
  for element_a in myArray:
    for element_b in myArray:
      if element_a == element_b:
        return TRUE

  return FALSE

The algorithm as written above has a run-time complexity of Select an answer O(n^3) O(n^2) O(2^n) O(1) O(log(n)) O(n!) O(n)