Explain the P vs NP problem in computational complexity theory. Define P and NP clearly, and provide examples of problems in each category. Discuss the significance of this problem for computer science, mathematics, and broader society. What would be the implications if P = NP? If P ≠ NP? Describe several approaches researchers have taken to solve this problem and why it has remained unsolved for so long.