Which statements have currently (Jan 2023) been proved? (You may assume that the P versus NP problem has not been solved). There are no NP-complete problems in P. RSA is secure against polynomial-time attacks. There exist a computable decision problem that does not belong to NP. HAM (Hamiltonian path) is polynomial-time reducible to SAT SAT is polynomial-time reducible to HAM (Hamiltonian path) The Diffie-Helman protocol cannot be broken in polynomial time