Answer:
P versus NP is the following question of interest to people working with computers and in mathematics: Can every solved problem whose answer can be checked quickly by a computer also be quickly solved by a computer? ... NP problems are fast (and so "easy") for a computer to check, but are not necessarily easy to solve.
Explanation: