Travelling Salesman Problem (TSP) [br]Given a list of cities and the euclidean distances between each pair of cities, [br]what is the shortest possible route that visits each city exactly once and returns to the origin city?[br][br]Command Travellingsalesman()[br]Returns the shortest closed path which goes through each point exactly once.[br][br]Drag the points[br]