Suppose H(M) is a cryptographic hash function that maps a message of an arbitrary bit length on to an n-bit hash value. Briefly explain the primary security requirements of the hash function H. Assume that Houtputs 16-bit hash values. How many random messages would be required to find two different messages M and M'such that H(M) HM')