Please help with those two questions. Thanks!

Assume the cryptanalist has two pairs (z; y1) and (r; y2) such that yl DES(K z) and y2 DESK. z). exhaustive key search which requires only 255 encryption to find out K. (This would be a slight improvement over the total number of 256 keys) e Suppose the DES F function mapped every 32-bit input R, regardless of the value of the input K, to (a) 32-bit string of ones (b) bit-wise complement of F What function would DES then compute? Assume the cryptanalist has two pairs (z; y1) and (r; y2) such that yl DES(K z) and y2 DESK. z). exhaustive key search which requires only 255 encryption to find out K. (This would be a slight improvement over the total number of 256 keys) e Suppose the DES F function mapped every 32-bit input R, regardless of the value of the input K, to (a) 32-bit string of ones (b) bit-wise complement of F What function would DES then compute