input: Write a python function to solve the Traveling Salesman Problem (TSP) using a nearest neighbour algorithm.
  assert solve_tsp((1, 2), [(3, 4), (5, 6), (7, 8)]) == [(1, 2), (3, 4), (5, 6), (7, 8)]
  assert solve_tsp((0, 0), [(1, 1), (2, 2), (3, 3)]) == [(0, 0), (1, 1), (2, 2), (3, 3)]
  assert solve_tsp((0, 0), [(2, 2), (1, 1), (3, 3)]) == [(0, 0), (1, 1), (2, 2), (3, 3)]
output: def solve_tsp(start, points):
      import math
  
      def distance(p1, p2):
          return math.sqrt((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2)
  
      tour = [start]
      current_point = start
      points = points[:]
      
      while points:
          nearest = min(points, key=lambda p: distance(current_point, p))
          tour.append(nearest)
          current_point = nearest
          points.remove(nearest)
      
      return tour