can someone pelase explain this code in detail line by line 

import random import math #select 2 large prime numbers def generate_p_and_q(): #Calculating 1 to 100 prime numbers numbs = [i for i in range(2,101)] for n in range(2,101): for i in range(2,math.ceil(n/2)+1): if n % i == 0: numbs.remove(n) break else: continue #Selecting any 2 prime numbers randomly p = random.choice(numbs) numbs.remove(p) q = random.choice(numbs) return p, q p,q = generate_p_and_q() print(f'[+] p = {p} and q = {q}') n = p * q phi = (p - 1) * (q - 1) print(f'[+] n = {n} and euler totient = {phi}') #Calculating e -> gcd(e,phi) = 1 and 1 < e