input: Write a python function to find all prime numbers between two given numbers and return them in a dictionary.
  assert prime_numbers(8, 20) == {11: 11, 13: 13, 17: 17, 19: 19}
  assert prime_numbers(1, 10) == {2: 2, 3: 3, 5: 5, 7: 7}
  assert prime_numbers(15, 30) == {17: 17, 19: 19, 23: 23, 29: 29}
output: def prime_numbers(start, end):
      def is_prime(num):
          if num <= 1:
              return False
          for i in range(2, int(num**0.5) + 1):
              if num % i == 0:
                  return False
          return True
      
      primes = {}
      for num in range(start, end + 1):
          if is_prime(num):
              primes[num] = num
      return primes