If a sorted linked list is used to implement a map, then the contains operation would exhibit order of growth efficiency $($where N is the number of elements in the map$).$

$O(N^2)$

$O(1)$

$O(N)$

$O(LO{G}_2(N))$