Question

Prove that "P=NP" this is a tough question of computer science​

Answer 1

Answer:

let y be the proof of P=NP. the proof y can be verified in polynomial time by a competent computer scientist,the exiistence of which we assert.However, since P=NP, the proof y can be generated in polynomial time by such computer scientist