Consider a hash table that utilizes a perfect hash function $($resulting in no hash collisions$),$ what is the worst$-$case complexity you would expect the remove operation for this implementation to exhibit $($problem size $n=$ the number of key$-$value pairs stored in the hash table$)?$

O$($logn$)$

O$($nlogn$)$

$O(1)$

$O(n)$