Q 32,p3,j15 The travelling salesman problem can be solved in:

Options
A) POlynomial time using dynamic programming.
B)Polynomial time using branch and bound algorithm.
C)Exponential time using dynamic programming and branch and bound algorithms.
D)Polynomial time using backtrack algorithms.
Answer C.