Provide a comprehensive overview of the P vs NP problem. Define what it means for a problem to be in P (polynomial time) versus NP (nondeterministic polynomial time). Discuss the implications of P = NP versus P != NP for cryptography, optimization, and algorithm design. Illustrate with examples like the Traveling Salesman Problem.