Salesman Problem $($min$-$TSP$)$

Hint: Decision version of TSP is $NP-$complete, so you can design algorithm for it by defining the

certificate to be permutation of nodes, designing the verifier algorithm and then enumerating

every certificate and to verify it$.$