What is the big-Oh complexity of this algorithm?  (NOTE: The…

What is the big-Oh complexity of this algorithm?  (NOTE: The next question refers to this function.) def f2(a, b):     ”’ Count identical elements in `a` and `b` ”’     count = 0     for i in range(len(a)):         for j in range(len(b)):             if a == b:                 count += 1     return count