The Traveling Salesman Problem $($TSP$)$ is best described as:

A

B$.$

D$.$

Finding the shortest path between two nodes in a graph

Finding the maximum flow in a network.

Finding a cycle that visits each vertex exactly once and retums to the starting verte&

Finding the shortest path that visits each node at least once