From the following public key, decrpyt the flag below:

-----BEGIN PUBLIC KEY----- MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQDIh16Sa3YCppifETNml6gKa/Cy 56AT/hxNJMx6zQmQuYvjEIBAbB4EnW346ewy1yRRVDBKVYrJTHbmw2nIHbQGP5QU 8GDbRogM05RCkorSZjB03L8Zhpp1u7hi8/dhPnKbQnrCHrI+S5EAu4OK3ywh76 KlBOb/G1+py02ESHWwIDAQAB -----END PUBLIC KEY----- Flag to decrypt mPWM4kial8Cp1AuygSB8Cw/dUX7FEKGZi5JEzN/Gc8EVY5N5F6IXU1eW4HiT7rzpkl42lVKMfclMdEruWd1cACE3pSM5YyX/rW06GwlFXwCf59RnlUBPBngTfe3lv5bs0q6S0Sk7Sx81hyaPcSJqEP8xJuBYANEVYyx5eKk2RGs=

. Components of RSA o C-the ciphertext you want to attack ( C-Pe mod n ) o n-the modulus of the keys, created as a product of two large prime numbers, p and q o (n, e) -the public key o (n, d)-the private key o Attack steps: o choose X where X is relatively prime to n o create Y C X mod r oget Z-decrypted Y o find out X1, the modular inverse of X P=Z"X-1 mod n o . Components of RSA o C-the ciphertext you want to attack ( C-Pe mod n ) o n-the modulus of the keys, created as a product of two large prime numbers, p and q o (n, e) -the public key o (n, d)-the private key o Attack steps: o choose X where X is relatively prime to n o create Y C X mod r oget Z-decrypted Y o find out X1, the modular inverse of X P=Z"X-1 mod n o