Consider the following statements:

(I). In perfect hashing no collision resolution has to be implemented.

(II). Perfect hash functions may be used to implement a lookup table with constant worst-case access time.

Which of the above statement/s is/are TRUE?