Consider the following (non modular) hash function. Messages are in the form of a sequence of numbers in Zn, M = (ay, Az

[answerhappygod]

Consider the following (non modular) hash function. Messages are in the form of a sequence of numbers
in Zn, M = (ay, Az,.., at). The hash value is calculated as [l=, a; for some predefined value n.
- Does this hash function satisfy any of the requirements for a hash function (provided table)?
B) Repeat part (a) for the hash function h= (Zi= (a;)3) modn.
C) Calculate the hash function of part (b) for M = (189, 632, 900, 722, 349) and n = 989.