Please show all work

This problem introduces a hash function that operates on letters. It is called the toy tetragraph hash th). Given a message consisting of a sequence of letters, produces a hash value consisting of four letters. First, tth divides the message into blocks of 16 letters, ignoring spaces, punctuation, and capitalization. if the message length is not divisible by 16, it is padded out with character X. A four-number running total is maintained that starts out with the value (0, 0, 0, o) The function consists of two rounds Round 1: Get the next block of text and arrange it as a row-wise 4x 4 block of text and covert it to numbers (A = 0, B = 1 and so on), generating a 4x4 number table. For the block ABCDEFGHIJKLMNOP, we have: A BCD 0 2 3 8 910 11 12 13 14 15