You are given a hash function for three digit integer search keys and a hash table of size $1000.$ The hash function multiplies the digits of an integer search key modulo the table size. For example, h$(123)=(1*2*3)\%1000=6.$ Choose the best statement below:

You are given a hash function for three digit integer search keys and a hash table of size $1000.$ The hash function multiplies the digits of an integer search key modulo the table size. For example, h$(123)=(1*2*3)\%1000=6.$ Choose the best statement below:

this hash function evenly distributes keys throughout the hash table

this hash function won't use all spaces available in the hash table

this hash function is invalid because it cannot deterministically compute the hash value

this hash function requires hundreds of multiplies to compute the hash value and thus is inefficient