Q.5. (Marks:20). What is the estimated space and time complexity for performing Meet-in-the-middle attack on triple DES algorithm using known plain text attack? You can assume that as an adversary you have got 3 pairs of (m1,c1),(m2,c2),(m3,c3). Assume the encrypt and decrypt process if defined as below and k1!=k2!=k3. Encrypt: c=E(m)=Ek3Dk2Ek1(m) Decrypt: m=D(c)=Dk1Ek2Dk3(m)