input: Write a python function to find the closest pair of points from a list of points.
  assert find_closest_pair([[2, 3], [12, 30], [40, 50], [5, 1], [12, 10], [3, 4]]) == ([2, 3], [3, 4])
  assert find_closest_pair([[0, 0], [1, 1], [2, 2], [3, 3], [4, 4]]) == ([0, 0], [1, 1])
  assert find_closest_pair([[5, 5], [1, 1], [4, 4], [2, 2], [3, 3]]) == ([1, 1], [2, 2])
output: def find_closest_pair(points):
      import math
      from itertools import combinations
  
      def distance(p1, p2):
          return math.sqrt((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2)
  
      min_dist = float('inf')
      closest_pair = None
  
      for p1, p2 in combinations(points, 2):
          dist = distance(p1, p2)
          if dist < min_dist:
              min_dist = dist
              closest_pair = (p1, p2)
  
      return closest_pair