The travelling salesman problem can be solved using _________

• A. A spanning tree
• B. A minimum spanning tree
• C. Bellman – Ford algorithm
• D. DFS traversal