Consider a version of the division method in which h$($k$)=$ k mod m$,$ where m $=2^$p $-1$ and l is a character string interpreted in radix $2^$p$.$ Show that if string x has the same value. Give an example of an application in which this property would be undesirable in a hash function.