If you can find a perfect hash function for your particular set of keys, the ADT dictionary will provide operations with efficiency of

Group of answer choices

O$(1)$

O$($log n$)$

O$($n$)$

O$($n$^2)-$ n raised to the power $2$