Explain the major complexity classes (P, NP, NP-complete, PSPACE, EXPTIME) and their relationships. Discuss the significance of the P versus NP problem and its implications for mathematics, computer science, and beyond. Analyze common techniques for proving problems are in different complexity classes and barriers to resolving complexity questions.