(C++) Hello, write this code in C++

Also, give an explanation for the last sentences of this instruction please!! Thanks,

2) RSA Encryptionn One place the greatest common divisor is used is in encryption schemes. RSA encryption is one common encryption scheme. It uses the following steps If I want you to send me an encrypted message, I take any two relatively large prime numbers p and q (we'll use 11 and 17 for this example, although the primes actually used are much larger) and multiply them together to get n = pq: 187 1. 2. I next take any number e with the property that gcd(e, (p - 1)(q-1))1. (e.g., e = 3 works since gcd(3, (11-1) * (17-1))-1.) 3. I send you e and n To send me an encrypted message you take your message, assign numerical equivalents to each character, and then encrypt these numerical equivalents by C ae mod n. You then send the results. (The real algorithm actually takes groups of letters, rather than single letters at a time; however, we are asking you to simplify this by encoding each letter separately.) 4. Example: S TP 19 20 15 16 193 mod 187 127 203 mod 187146 153 mod 187 = 6 163 mod 187 169 Write two functions: 1. A function check_epq that, given e and prime numbers p, and q, checks whether (You can assume p and q are prime here.) Hint: use your ged function from gcd(eKp-1X4-1))-1 the previous problem. 2. A function char_to_number that takes in an upper case alphabetic character, and returns an integer