Explain the theoretical foundations of computational complexity theory. Define the complexity classes P, NP, NP-complete, and NP-hard. Discuss the significance of the P vs NP problem. Provide examples of problems that belong to each complexity class. Explain what would happen if P = NP were proven. Discuss recent progress and insights into this fundamental theoretical computer science problem.