input: Write a function to generate prime numbers between 1 and a given number n. The function should print each prime number within the specified range.
  def generate_prime_numbers(n): 
      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(10)
  # Expected output: 2 3 5 7
  
  assert generate_prime_numbers(0)
  # Expected output: (no output)
  
  assert generate_prime_numbers(1)
  # Expected output: (no output)
  
  assert generate_prime_numbers(20)
  # Expected output: 2 3 5 7 11 13 17 19
output: def generate_prime_numbers(n): 
      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)