A cryptographic hash function needs to be second preimage resistant, which means that given the message M and the message digest d, we should not be able to find any other message, M′, whose digest is d. In other words, two different messages cannot have the same digest. Based on this requirement, show that a traditional checksum in the Internet cannot be used as a hash function.