The correct answer is option 3. Data:p = 3, q = 11 and d = 7Formula:?(n)=(p-1)x(q-1)n=p x qCalculation:n=3 x 11 =33?(n)==(3-1)x(11-1) = 20ex7 mod ?(n)=1Option 3if e=3, 7x3 mod 20 =1Encrypt key Memod n= CC=193mod 33C=28? Hence the correct answer is (3,28) RSA Algorithm (Rivest Shamir Adleman):Step 1: choose two large primes, p,qStep 2: Compute n=pxq , ?(n)=(p-1)x(q-1)Step 3: Choose a number relatively prime to ?(n) and call it 'd' , GCD(d, ?(n))=1Find 'e' such that, exd mod ?(n)=1Encrypt key Memod n= C where C=ciper textDecrypt key Cdmod n= M where M=plain text