Travelling Salesperson Problem is an example of -
A
Ploynomial -time
B
Np-Complete
C
NP
D
NP- Hard
Correct Answer: NP- Hard