A student has written the following code fo detect if a collection has duplicates. What is its running time?

def has dups$($L$)$

$n=$len$(L)$

for $i$ in range$(n)$:

for $j$ in range$(n)$:

If $ij$ and $L[i]==L[j]$

return True

return False

$O(1)$

$O(log(n))$

$O(n)$

$O(n^2)$

$O(n^3)$