Which of the following statements accurately describes a perfect hash function?
A. A perfect hash function maps items to buckets with no collisions.
B. A perfect hash function uses chaining to resolve collisions.
C. A perfect hash function uses open addressing to resolve collisions.
D. A perfect hash function has O(N) time complexity for inserting into a hash table.