Please answer!

Asymmetrical encryption uses one key to encrypt and another key to decrypt. The most common algorithm used in applications is the RSA algorithm. RSA is based on prime numbers. . Select two small prime numbers and compute Product- (p-1)(q-1)and select a number e between 1 and Product. The e that you computed is a simplified example of a public key. Post your selection and computation . The RSA algorithm and most asymmetric encryption are considered n, explain why the algorithm is slow