Suppose that one has designed a hash table with table size $n$ that does not support resizing. The load factor is close to $1,$ what is the worst case computing complexity for insertion in this case when linear probing is used?

$O(nlogn)$

$O(logn)$

$O(n)$

$O(1)$