input: Write a function to return a dictionary with all the prime numbers between two given numbers as input. If there are no prime numbers in the given range, return an empty dictionary.
  assert prime_numbers(8, 20)=={11: 11, 13: 13, 17: 17, 19: 19}
  assert prime_numbers(1, 5)=={2: 2, 3: 3, 5: 5}
  assert prime_numbers(10, 12)=={}
  assert prime_numbers(100, 105)=={101: 101}
  assert prime_numbers(0, 1)=={}
output: def prime_numbers(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
      
      primes = {}
      for num in range(start, end + 1):
          if is_prime(num):
              primes[num] = num
      return primes