What is a perfect hash in a hash table?

Two different keys hashing to a value outside of the range of the table.Two different keys hashing to a value outside of the range of the table.

A hash table that does not have any primary clustering.

A hash table that is completely full.

A hash function that yields a uniform distribution in its hash results before normalization.

A hash function that returns a hash value that does not need to be normalized into the table.

Two different keys being normalized into the hash table at the same index.

All keys added to the table without any collisions.