In the TSP problem of n cities, the time taken for traversing all cities, without having prior knowledge of the length of the minimum tour will be_______.
Answer: c. O(n!)
Explanation: In the TSP problem of n cities, the time taken for traversing all cities without having prior knowledge of the length of the minimum tour will be O(n!).