input: Write a function that takes two numbers as input and returns a dictionary with all the prime numbers between them. If the given numbers are not prime, they should be included in the dictionary as well.
  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
          else:
              prime_nums[i] = i
      return prime_nums
  
  assert prime_numbers(8, 20) == {8: 8, 11: 11, 13: 13, 17: 17, 19: 19}
  assert prime_numbers(2, 10) == {2: 2, 3: 3, 5: 5, 7: 7, 10: 10}
  assert prime_numbers(1, 5) == {1: 1, 2: 2, 3: 3, 5: 5}
  assert prime_numbers(-3, 3) == {-3: -3, -2: -2, -1: -1, 0: 0, 1: 1, 2: 2, 3: 3}
  assert prime_numbers(13, 14) == {13: 13, 14: 14}
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
          else:
              prime_nums[i] = i
      return prime_nums