7.11. In this exercise, you are asked to attack an RSA encrypted message. Imagine being the attacker: You obtain the ciphertext y=1141 by eavesdropping on a certain connection. The public key is kpub = (n,e) = (2623,2111). 1. Consider the encryption formula. All variables except the plaintext x are known. Why cant you simply solve the equation for x? 2. In order to determine the private key d, you have to calculate d e1 mod (n). There is an efficient expression for calculating (n). Can we use this formula here? 3. Calculate the plaintext x by computing the private key d through factoring n = p q. Does this approach remain suitable for numbers with a length of 1024 bit or more?

Answer them please in details and step by step. I know there are some answers online but they aren't clear to me.