input: Write a python function to optimize a given function using brute force search over a specified range.
  assert optimize_function(lambda x, y: x**2 + y**2, (-5, 5), (-5, 5)) == (-5, -5)
  assert optimize_function(lambda x, y: -(x**2 + y**2), (-5, 5), (-5, 5)) == (0, 0)
  assert optimize_function(lambda x, y: x*y, (0, 3), (0, 3)) == (3, 3)
output: def optimize_function(func, x_range, y_range):
      min_value = float('inf')
      min_point = (None, None)
      
      x_min, x_max = x_range
      y_min, y_max = y_range
      
      for x in range(x_min, x_max + 1):
          for y in range(y_min, y_max + 1):
              value = func(x, y)
              if value < min_value:
                  min_value = value
                  min_point = (x, y)
      
      return min_point