You have been given two prime numbers, p $=11$ and q $=17,$ to construct an RSA encryption

system. Follow the steps below to set up the RSA encryption and encrypt a given plaintext

message.

Step $1$: Calculate the modulus $($n$)$ by multiplying p and q$.$

Step $2$: Calculate Euler's totient function $(\backslash$phi $($n$))$ using the formula: $\backslash$phi $($n$)=($p $-1)*($q $-1).$

Step $3$: Choose an encryption exponent $($e$)$ that is relatively prime to $\backslash$phi $($n$).$

Step $4$: Calculate the decryption exponent $($d$)$ using the formula: d $$ e$^(-1)$ mod $\backslash$phi $($n$).$

Step $5$: Your friend has provided their public key, which consists of the encryption exponent $($e$)$

and modulus $($n$).$ The plaintext message you want to send is "RSA". Each letter in the plaintext

message corresponds to a numerical value $($A$=1,$ B$=2,$ C$=3,$ and so on$).$ To encrypt the message,

you need to perform RSA encryption using your friend's public key.

Calculate the ciphertext of the message "RSA" using RSA encryption with your friend's public key

$($encryption exponent $=$ e$,$ modulus $=$ n$).$