Implement any scheme to find the optimal solution for the Traveling Salesperson problem
Traveling Salesperson problem:Given n cities, a salesperson starts at a specified city (source), visit all n-1 cities only once and return tio the the city from where he has started.…