osuigwewhitney1560 osuigwewhitney1560 26-04-2024 Business contestada According to the fact that the Traveling Salesman Problem is NP-complete, its complexity can be described as: a) Exponential b) Polynomial c) Linear d) Logarithmic