Connor and his cat Chubalubs are sharing secret messages through a matrix encoder method. They begin by writing plain text messages and converting them into numeric sequences. The conversion changes 'a' to 1, 'b' to 2, and so on up to 'z' being 26. Spaces between words are represented by the number 27. The number sequence is then broken up into many 2×12×1 column vectors before being arrayed in a size 2×m2×m matrix. For example, if you started with the message 'example text', you would convert it into the numeric sequence 5,24,1,13,16,12,5,27,20,5,24,205,24,1,13,16,12,5,27,20,5,24,20, and then into the message matrix: B=[51165202424131227520]B=[51165202424131227520] You would then multiply this message matrix by an encoder matrix AA to output the encrypted message matrix CC such that AB=CAB=C. In his folly, Connor has dropped a copy of the encoding matrix AA that he and Chubalubs share. You learn its element values: A=[2537]A=[2537] Using the encoder matrix, de-crypt the following secret message and write it as plain text in the blank provided: C=[46471231176566175164]C=[46471231176566175164] The secret message is cana hiswcana hisw (lower-case) Note: this is actually how end-to-end encryption is done with your messages on the internet. Although in practice the matrices used for encrypting are far more elaborate!