A perfect hash function $\_\_\_\_\_.$

Question $2$ options:

maps items to buckets with no collisions

uses chaining to resolve collisions

uses open addressing to resolve collisions

has O$($N$)$ time complexity for inserting into a hash table