This project introduces students to an encryption scheme called the Hill substitution cipher. This encryption technique encodes information via a matrix multiplication and decodes data by multiplying by the inverse matrix. The encoding matrix is typically kept private to keep the original information secure. Without this decoding "key," the encrypted data is difficult to decode. This encoding and decoding process can be thought of as a coordinate transformation. Original English words/letters are mapped to a new set of scrambled "coordinates" in the encoded data. Multiplying encoded data by the inverse change-ofcoordinates matrix returns the scrambled data back to the original coordinates/words. Hill Substitution Cipher provides general background theory on this encoding scheme and also works similar examples to those you are asked to work below. Problems 1. Compute the following matrix product modulo 26. [ 17 22 4 2 9 11 4 6 13 ][ 21 1 18 25 22 20 17 24 19 ] 2. Consider the key matrix A = [ 10 18 1 17 1 3 4 7 21 ]. Use this key matrix to encode the phrase "LINEAR ALGEBRA IS SO EASY". 3. Compute A −1 mod 26 4. Decode the message VYOCGMSYUFYVTZSHDLURX which was encoded using the key matrix A.