Discuss the P vs NP problem in computational complexity theory. What would be the implications if P = NP? If P ≠ NP? Provide examples of problems in P, NP, NP-complete, and NP-hard classes. Explain the concept of polynomial-time reduction and its significance in classifying computational problems. How do these complexity classes relate to practical algorithmic challenges in computer science?