input: Write a python function to find the closest point from a set of coordinates using Euclidean distance.
  assert find_closest_point((2, 3), [(2.1, 3.1), (1, 1), (0.5, 2.5)]) == (2.1, 3.1)
  assert find_closest_point((0, 0), [(1, 1), (-1, -1), (2, 2)]) == (1, 1)
  assert find_closest_point((5, 5), [(1, 2), (7, 8), (6, 6)]) == (6, 6)
output: def find_closest_point(p, points):
      def euclidean_distance(p1, p2):
          return ((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2) ** 0.5
  
      closest_point = min(points, key=lambda point: euclidean_distance(p, point))
      return closest_point