QUESTION $9$

TSP $-$ Travelleing Salesperson Problem which states that "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?

Which one statement out of following statements is true?

TSP is similar to using Kruskal's algorithm

TSP is similar to using Prim's algorithm

TSP is similar to using Dikjstra's algorithm

TSP is similar to finding shortest path hamilton cycle.