(K-Traveling Salesmen Problem) Consider the version of the traveling salesman problem where there are K salesmen that start at city 1, return to city 1, and collectively must visit all other cities exactly once. Transform the problem into an ordinary traveling salesman problem.