Given a graph and a node in it as the starting point, the travelingsalesman problem (TSP) is about finding a least cost path that starts and ends at thestarting node, and goes through each other node in the graph once and exactly once. Theedges of the graph are labeled by a number representing the cost of traveling between theconnecting two nodes. Formulate this problem as a search problem by specifying the states,possible initial states, goal test, operators, and operator costs