Define the complexity classes P (problems solvable in polynomial time) and NP (problems verifiable in polynomial time). Explain why the question of whether P equals NP is critical to cryptography, optimization, and mathematics. Discuss the implications if P were proven to equal NP versus if they were proven to be distinct.