input: Write a python function to find the sum of all prime numbers in a given interval.
  assert prime_sum_in_range(10, 20) == 60
  assert prime_sum_in_range(30, 50) == 328
  assert prime_sum_in_range(100, 200) == 4221
output: def prime_sum_in_range(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
  
      total = 0
      for num in range(start, end + 1):
          if is_prime(num):
              total += num
  
      return total