Explain the P vs NP problem and its significance in computer science and mathematics. Discuss what would be the implications if P=NP or if P≠NP. Provide examples of problems in each complexity class. Analyze major approaches that have been attempted to solve this problem and the barriers encountered.