The traveling salesman problem involves n cities with paths connecting the cities. The time taken for
traversing through all the cities, without knowing in advance the length of a minimum tour, is
___________
a) O(n)
b) O(n2)
c) O(n!)
d) O(n/2)
traversing through all the cities, without knowing in advance the length of a minimum tour, is
___________
a) O(n)
b) O(n2)
c) O(n!)
d) O(n/2)