Please help! Thank you in advance

(3 marks) Assume the cryptanalist has two pairs (z; yl) and (z;y2) such that yl = DES(K,2) and y2 = DES(K,T). Build a exhaustive key search which requires only 255 encryption to find out K. (This would be a slight improvement oven the total umber of 256 keys) (3 marks) Assume the cryptanalist has two pairs (z; yl) and (z;y2) such that yl = DES(K,2) and y2 = DES(K,T). Build a exhaustive key search which requires only 255 encryption to find out K. (This would be a slight improvement oven the total umber of 256 keys)