Question $24$

$4pt$

Suppose we maintain two linked lists of length $n$ in random element order. What would be the big$-$Oh notation for the creating a third list that includes only elements common to both lists, without sorting the first two lists?

$O(1)$

$O(n)$

$O(nlogn)$

$O(n^2)$