If tomorrow is proven that P != NP, what may be some of the Computer Science implications? (Multiple Choice)

Question

If tomorrow is proven that P != NP, what may be some of the  Computer Science implications? (Multiple Choice)

Answer

All cryptography theory will need to be reformulated

Answer

There will be optimization problems that will never have a polynomial solution.

Answer

All sorting problems can be executed in O(1)

Answer

Not a lot of implications, it is assumed that is the case already.

Crowdly