Here is a new hash function, let's call it letter-hash. First, consider the mapping of letters to numbers less than 26, A doubleheadarrow 0, B doubleheadarrow 1, , Z doubleheadarrow 25. Say that num(#) is the numerical value of the letter #. In other words num(K) = 10. Then for a message of n letters, the hash of a message that is: is [num() * 26^n-1 + num() * 26^n-2 + num() * 26^n-3 + + num() * 26 + num()] mod 100000 Compute the letter-hash value of the message WIZARDS. Find a different message that will hash to the same value