can someone pelase explain this code in detail line by line

import random

import math

# Generates two prime numbers

def generate_primes():

#Generate all prime numbers between 2 and 100

primes = [num for num in range(2, 101) if all(num % i != 0 for i in range(2, int(math.sqrt(num)) + 1))]

return random.sample(primes, 2)

# Selects p and q

p, q = generate_primes()

# Calculates n, the product of p and q

n = p * q

# Calculates phi, the totient of n

phi = (p - 1) * (q - 1)

# Finds a value for e that is relatively prime to phi

def find_e(phi):

for e in range(2, phi):

if math.gcd(e, phi) == 1:

return e

e = find_e(phi)

# Finds a value for d that satisfies the equation (d * e) % phi == 1

def find_d(e, phi):

for d in range(2, phi):

if (e * d) % phi == 1:

return d

d = find_d(e, phi)

# Selects a random integer as the message to be encrypted

msg = random.randint(1, n)

# Encrypts the message using the values for e and n

def encrypt_msg(msg, e, n):

return (msg ** e) % n

e_msg = encrypt_msg(msg, e, n)

# Decrypts the message using the values for d and n

def decrypt_msg(e_msg, d, n):

return (e_msg ** d) % n

d_msg = decrypt_msg(e_msg, d, n)

print(f'[+] p = {p} and q = {q}')

print(f'[+] n = {n} and euler totient = {phi}')

print(f'[+] e = {e}')

print(f'[+] d = {d}')

print(f'[+] msg : {msg}')

print(f'[+] Encrypted msg : {e_msg}')

print(f'[+] Decrypted msg : {d_msg}')