THE QUESTION IS BASED ON THE FIRST QUESTION ! BUT I NEED A HELP WITH QUESTION 2 ONLY THANK YOU

Suppose we define an encryption scheme as follows. The key will be four elements k_1,k_2, k₃ and k₄ in ₂₆. The message space will be sequences of elements of ₂₆ of length 6. The ciphertext space will be the same as the message space.

The encryption algorithm is the following. Given a key k_1, k_2, k₃and k₄ and a message , (a_1,a_2, a_3, a_4, a_5, a₆ ), the corresponding ciphertext is (b_1,b_2,b_3,b_4,b_5, b₆₎ , where:

2, C = a WA 9 e d Dale a ave 98 Q1, Part d (BONUS) Recover the key used to produce the known plaintext pair. 99 1001 Answer here (with work!) 1012 1023 103 4 104 111 Question 2 You may know that the cipher described in Question 1 is the Hill Cipher and that the key elements k1, kg, kg and k4. NL However let us ignore this fact and suppose that any four elements in 20 can be a key 112 119 Question 2, part a How many keys are there in the Hill Cipher described above? 120, 1211 Answer here 122