Problem 4.12 in the textbook( C. Paar and J. Pelzl, Understanding Cryptography, Springer, 2009. ISBN 978-3-642-04100-6.): We now examine the gate (or bit) complexity of the MixColumn function, using the results from problem 4.11. We recall from the discussion of stream ciphers that a 2-input XOR gate performs a GF(2) addition. 1. How many 2-input XOR gates are required to perform one constant multiplication by 01, 02 and 03, respectively, in GF(2^8)? (Answer1), (Answer2) , (Answer3) 2. What is the overall number of XOR gates that are required to complete one matrixvector multiplication? (Answer4) 3. What is the number of XOR gates that are required for the entire Diffusion layer? (We assume permutations require no gates) (Answer5)