input: Write a python function to find the optimal route that minimizes travel distance between stops.
  assert find_optimal_route([(0, 0), (1, 2), (3, 1), (3, 4)]) == ((0, 0), (3, 1), (1, 2), (3, 4))
  assert find_optimal_route([(0, 0), (2, 2), (1, 1)]) == ((0, 0), (1, 1), (2, 2))
  assert find_optimal_route([(0, 0), (1, 1), (1, 0), (0, 1)]) == ((0, 0), (1, 0), (1, 1), (0, 1))
output: def find_optimal_route(stops):
      from itertools import permutations
      from math import sqrt
      
      def distance(p1, p2):
          return sqrt((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2)
      
      def total_distance(route):
          return sum(distance(route[i], route[i + 1]) for i in range(len(route) - 1))
      
      best_route = min(permutations(stops), key=total_distance)
      return best_route