input: Write a function to print prime numbers within a given range.
  assert printPrimeNumbers(2, 10) == [2, 3, 5, 7]
  assert printPrimeNumbers(10, 20) == [11, 13, 17, 19]
  assert printPrimeNumbers(1, 5) == [2, 3, 5]
output: def printPrimeNumbers(start, end):
      def is_prime(n):
          if n <= 1:
              return False
          for i in range(2, int(n**0.5) + 1):
              if n % i == 0:
                  return False
          return True
      
      prime_numbers = []
      for num in range(start, end + 1):
          if is_prime(num):
              prime_numbers.append(num)
      return prime_numbers