Give a brute force algorithm for Minimum Weight Traveling Salesman Problem (mini-TSP) Hint: Decision version of TSP in NP-complete, so you can design algorithm for it by defining the certificate, designing the verifier algorithm and then enumerating every certificate and to verify it. Then you can use binary search and decision-TSP algorithm to design brute force algorithm for min-TSP