Define and explain the relationships between major complexity classes including P, NP, NP-complete, NP-hard, PSPACE, and EXPTIME. Discuss the significance of the P versus NP problem and its implications for mathematics, computer science, and cryptography. Provide examples of problems in each complexity class and explain diagonalization techniques used to prove separations between classes.