a$.$ Consider the following hash function. Messages are in the form of a sequence of

numbers in $Z_n,M=(a_1,a_2,dots{a}_t).$ The hash value $h$ is calculated as $({\displaystyle \underset{i=1}{\overset{t}{}}}{a}_i)$ for

some predefined value $n.$ Does this hash function satisfy any of the requirements

for a hash function listed in Table $11\mathrm{.}1?$ Explain your answer.

b$.$ Repeat part $($a$)$ for the hash function $h=({\displaystyle \underset{i=1}{\overset{t}{}}}(a_i{)}^2)modn.$

c$.$ Calculate the hash function of part $($b$)$ for $M=(189,632,900,722,349)$ and

$n=989.$