The time complexity of brute-force algorithm for a traveling salesperson for visiting a tour of n cities is O(nlogn) On!) 0(2") O(logn)