Suppose that a hashing function sums up ASCII values of all characters in a key, and applies the modulo operator to the result, just like in the first video about hashing we watched in class. Select all statements that are true in this scenario.

$($NOTE: In that video, each key was three characters long and the size of the has table was $11,$ but the statements below are true or false for situations where keys may be variable length strings and any size hash table.$)$

Group of answer choices

Elements with keys that are anagrams of one another $($such as "tea" and "ate"$)$ will be stored at the same index if open addressing is used

If separate chaining is used, the key of each element in a bucket will be an anagram of the keys of all the other elements in the same bucket

If open addressing is used, if is possible that an element that hashes to some index x is stored at some other index y

If separate chaining is used, it may be possible that keys of two elements in the same bucket do not have any characters in common

All possible collisions will be between elements whose keys are anagrams of one another $($such as "tea" and "ate"$)$

Elements with keys that are anagrams of one another $($such as "tea" and "ate"$)$ will hash to the same index

Elements with keys that are anagrams of one another $($such as "tea" and "ate"$)$ will be stored at the same index if separate chaining is used