4. Which of the following is true about hash tables? A. It is possible to assign more than one data to a key B. Searching a hash table is always constant C. The size of the table must be prime D. The size of the table should be greater than the number of data that will be stored E. It is possible that the size of the table is smaller than the size of the key space