the function find_dplicates(elements) is a Python function that takes in a list of integers (elements), checks whether there any duplicate numbers in the list elements, and returns True/False accordingly. The following is one way to implement the function find_duplicates.

def find_duplicates(elements: List[int]): for i in range(len(elements)): for j in range(i + 1, len(elements)): if elements[i] == elements[j]: return True return False

Study above function and answer below questions:

What is time complexity of find_dplicates?

Is it possible to improve on above algorithm performance (in terms of its asymptotic cost)? If yes, provide your alternative function and the improved time-complexity.