input: Write a function to print all prime numbers between 1 and a given number n. The function should return None and use a sieve method to find all prime numbers up to n.
  def generate_prime_numbers(n):
      if n < 2:
          return None
      prime_list = [True for i in range(n + 1)]
      p = 2
      while (p * p <= n):
          if prime_list[p]:
              for i in range(p * p, n + 1, p):
                  prime_list[i] = False
          p += 1
      for p in range(2, n + 1):
          if prime_list[p]:
              print(p)
      return None
  
  assert generate_prime_numbers(10) is None
  assert generate_prime_numbers(20) is None
  assert generate_prime_numbers(2) is None
  assert generate_prime_numbers(1) is None
  assert generate_prime_numbers(0) is None
output: def generate_prime_numbers(n):
      if n < 2:
          return None
      prime_list = [True for i in range(n + 1)]
      p = 2
      while (p * p <= n):
          if prime_list[p]:
              for i in range(p * p, n + 1, p):
                  prime_list[i] = False
          p += 1
      for p in range(2, n + 1):
          if prime_list[p]:
              print(p)
      return None