input: Write a function to generate a dictionary containing all the prime numbers between two given numbers as input. If there are no prime numbers between the two numbers, return an empty dictionary.
  def prime_numbers(x, y):
   
   prime_nums = {}
   
   for i in range(x, y+1):
   if(i > 1):
   for j in range(2, i):
   if(i % j == 0):
   break
   else:
   prime_nums[i] = i
   
   return prime_nums
   
  assert prime_numbers(8, 20) == {11: 11, 13: 13, 17: 17, 19: 19}
  assert prime_numbers(2, 7) == {2: 2, 3: 3, 5: 5, 7: 7}
  assert prime_numbers(4, 5) == {5: 5}
  assert prime_numbers(9, 10) == {}
  assert prime_numbers(0, 1) == {}
output: def prime_numbers(x, y):
      prime_nums = {}
      for i in range(x, y+1):
          if i > 1:
              for j in range(2, i):
                  if i % j == 0:
                      break
              else:
                  prime_nums[i] = i
      return prime_nums