Please explain your steps and process to get this code

In C$++$ create the following functions:

MRT $=>$ Use Miller$-$Rabin Primality Test to choose a prime number with s$=512$ bits and check the primality test.

EA $=>$ Use Euclidean Algorithm to evaluate gcd

EEA $=>$ Use Extended Euclidean Algorithm to find modular inverse of the value

powmod$\_$sm $=>$ Square and multiply algorithm to evaluate exponentiation.

Now write the code for

RSA Key Generation $($use above functions $1.,2.,3.)$ should be

Choose two primes p and q of s bits using MRT where p is not equal to q$.$

Calculate n$=$p$*$q$,$ and $($n$)=($p$-1)*($q$-1)$

Chose randomly e from the set of $\{1,...,$n$-1\}$ and check using EA if gcd$($e$,($n$))=1$ if not chosen again until it fulfills the condition.

Calculate d$=$e$-1$ mod $($n$)$ using EEA. Note that d should be at least $0\mathrm{.}3*$s bits

Output kPub$=($n$,$e$)$ and kPr $=($d$)$

RSA Encryption with input kPub$=($n$,$e$)$ and random plaintext x and output should be ciphertext y$,$ evaluate exponentiation using the function powmod$\_$sm

RSA Decryption with input kPr $=($d$)$ and ciphertext y and output should be plaintext x$,$ evaluate exponentiation using the function powmod$\_$sm$.$ Please make sure to check that you get the same plaintext value before the encryption.