input: Write a function that generates and prints all prime numbers between 1 and a given number n. If the given number n is less than 2, print nothing.
  
  def generate_prime_numbers(n): 
      if n < 2:
          return
  
      prime_list = [True for i in range(n + 1)] 
      p = 2
      while (p * p <= n): 
          if prime_list[p] == True: 
              for i in range(p * 2, n + 1, p): 
                  prime_list[i] = False
          p += 1
    
      for p in range(2, n): 
          if prime_list[p]: 
              print(p)
  
  assert generate_prime_numbers(20) == None # Output should be 2, 3, 5, 7, 11, 13, 17, 19 printed on separate lines
  assert generate_prime_numbers(0) == None # No output
  assert generate_prime_numbers(1) == None # No output
  assert generate_prime_numbers(2) == None # Output should be 2 printed
output: def generate_prime_numbers(n): 
      if n < 2:
          return
  
      prime_list = [True for i in range(n + 1)] 
      p = 2
      while (p * p <= n): 
          if prime_list[p] == True: 
              for i in range(p * 2, n + 1, p): 
                  prime_list[i] = False
          p += 1
    
      for p in range(2, n): 
          if prime_list[p]: 
              print(p)