Traveling salesman problem will have a total of _____different sequences.
A. n!
B. n-1
C. (n-a)!.
D. n
Answer:D
Traveling salesman problem will have a total of _____different sequences.
A. n! B. n-1 C. (n-a)!. D. n