input: Write a function to find all the numbers divisible by a given divisor within a certain range. The function should return a list of these numbers. If the range is empty, it should return an empty list.
  
  def find_numbers_divisible_by(m, n, divisor):
      divisible_numbers = []
      for i in range(m, n+1):
          if i % divisor == 0:
              divisible_numbers.append(i)
      return divisible_numbers
  
  assert find_numbers_divisible_by(36, 74, 6)==[36, 42, 48, 54, 60, 66, 72]
  assert find_numbers_divisible_by(1, 20, 3)==[3, 6, 9, 12, 15, 18]
  assert find_numbers_divisible_by(5, 5, 5)==[5]
  assert find_numbers_divisible_by(2, 1, 2)==[]
output: def find_numbers_divisible_by(m, n, divisor):
      divisible_numbers = []
      for i in range(m, n+1):
          if i % divisor == 0:
              divisible_numbers.append(i)
      return divisible_numbers