Step 2- Transposition: This intermediate ciphertext then fills the columns (left to right) of a transposition matrix using the keyword crime". Since "crime" consists of 5 letters the matrix contains 5 rows. Note that the matrix is filled up with AAA at the bottom right. The final cipher is read as rows based on alphabetical order of letters of the key "crime" FVADA FXPFA AFDVA VAVGA XAFDD To decode, the recipient sets up two matrices based on two keywords, first to undo the transposition and finally to undo the ADFGVX-substitution. Although this superencryption offers more security, it can be broken in steps. First, the ADFGVX-substitution cipher has to be deciphered. Secondly, the remaining transpositions can be undone by testing many possible transpositions. Reference: ADFGVX Cipher TASK 1 (15 points) Superencrypt "Abstractionism" by using keywords "Painter" for the ADFGVX substitution and "Kandinsky for the transposition matrix. TASK 2 (3 points) Please encrypt Claude Shannon's quote by using the given key: "Information is the resolution of uncertainty" Given key: n+2, n, n+1, n-2 Example You will encrypt the word "Hello" by using the given key above into "JDMJ