It is known that satisfiability is a np-complete problem. Assume that an O(n²⁰22) deterministic algorithm has been found for the satisfiability problem. What can be concluded about the relationship between P and NP?
1) P = NP
2) P ≠ NP
3) P is a subset of NP
4) NP is a subset of P