input: Write a function to generate a prime number sequence using Python. The function should take an integer n as input and print all prime numbers up to and including n.
  def generate_prime_numbers(n): 
          primes = [True for i in range(n+ 1)] 
          p = 2
          while (p * p <= n): 
              if (primes[p] == True): 
                  for i in range(p * p, n + 1, p): 
                      primes[i] = False
              p += 1
          primes[0] = False
          primes[1] = False
          for p in range(n + 1): 
              if primes[p]: 
                  print(p)
  assert generate_prime_numbers(10)  # Should print numbers 2, 3, 5, 7
  assert generate_prime_numbers(2)   # Should print number 2
  assert generate_prime_numbers(1)   # Should print no numbers
  assert generate_prime_numbers(0)   # Should print no numbers
output: def generate_prime_numbers(n): 
          primes = [True for i in range(n+ 1)] 
          p = 2
          while (p * p <= n): 
              if (primes[p] == True): 
                  for i in range(p * p, n + 1, p): 
                      primes[i] = False
              p += 1
          primes[0] = False
          primes[1] = False
          for p in range(n + 1): 
              if primes[p]: 
                  print(p)