} Suppose Professor Professorson has come up with a new hash function modulo_hash where each element...

 

Transcribed Image Text:

} Suppose Professor Professorson has come up with a new hash function modulo_hash where each element is taken modulo the next one, i.e., int modulo_hash(string s) { int m=s[0]; for(char c: s) m = c % m; return m; a) Assuming the string key k has bytes [3, 15,4] what is modulo_hash(k)? b) Is this a good hash function? If not, which of the four properties (determinism, good distribution, low prob. of collision, avalanche effect) does it not have? } Suppose Professor Professorson has come up with a new hash function modulo_hash where each element is taken modulo the next one, i.e., int modulo_hash(string s) { int m=s[0]; for(char c: s) m = c % m; return m; a) Assuming the string key k has bytes [3, 15,4] what is modulo_hash(k)? b) Is this a good hash function? If not, which of the four properties (determinism, good distribution, low prob. of collision, avalanche effect) does it not have?