Consider the following hash function $H(m),$ which receives as an input a message in the

form of a sequence of decimal numbers, $m=(D_1,D_2,$dots,$D_{\text{I}}).$ A$)$ If $H(m)$ is defined as $({\displaystyle \underset{i=1}{\overset{\text{I}}{}}}{D}_i)modn,$ for some predefine large value $n.$ Does this

hash function satisfy the pre$-$image resistance $($one$-$way property$)$ requirement?

Explain your answer.

B$)$ If $H(m)$ is defined as $({\displaystyle \underset{i=1}{\overset{\text{I}}{}}}{D}_i^2)modn,$ for some predefine large value $n.$ Does this

hash function satisfy the collision resistance requirement? Explain your answer.

C$)$ Calculate the hash function of part $($B$)$ for $m=(189,632,900,722,349)$ and $n=989.$ It is better for the solution to be written on paper