Define the classes P (problems solvable in polynomial time) and NP (problems verifiable in polynomial time). Explain the significance of the P vs NP question: If a solution to a problem can be verified quickly, can it also be found quickly? Discuss the implications for cryptography, optimization, and our understanding of computation if P were equal to NP versus if they were distinct.