Suppose we are using RSA, with a modulus n = pq, as follows: A message M is assumed to be a sequence of ascii characters, so we can treat each character as an integer in the interval [0, 2 ⁷ 1]. The message M is encrypted by applying RSA encryption to each character in M by itself. In other words, the message M (in binary representation) is subdivided into blocks of length 7. Describe a simple and efficient way to break this way of using RSA