Explain the P vs NP problem and its significance in theoretical computer science. Define the complexity classes P and NP, provide examples of problems in each class, and discuss why the question of whether P=NP is considered one of the most important open problems in mathematics and computer science. Discuss known results, implications for different fields if P=NP or P≠NP, and major approaches researchers have taken toward solving this problem.