Please solve by showing work. Thanks.

[6] In cryptography we often use matrix operations but modulo some M for the calculations (for example, in Hill substitution ciphers.) Do the following mod 26 calculations: a. Compute the following matrix product modulo 26 12'? 292 25 212 2D 1? 24 19 b. A \"key matrix\" is use to encode a message where blocks of letters are replaced by blocks of numbers (for example, BAD might become 204.) To decrypt the message, it is necessary to invert the key matrix (mod 26). If the key matrix is given as, 10 13 1 A = 1'? 1 3 4 T 21 then Compute til1 mod 2 6. (Hint: Row reduce the augmented matrix using modulo 26 calculations. Recall that the modulus of a number N is the reminder after dividing by the modulus M For example, 55 is equal to (we say \"congruent to\") 3 modulus (or \"mod 26\") since 55 2 2(26) + 3.) You mayr use software to assist doing this