input: Write a python function to count the number of prime numbers in a given range.
  assert primeCounet(10, 30) == 6
  assert primeCounet(1, 10) == 4
  assert primeCounet(20, 50) == 8
output: def primeCount(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
      
      count = 0
      for num in range(start, end + 1):
          if is_prime(num):
              count += 1
      
      return count