i$.$ Define the complexity class Co$$NP$.(2$ marks$)$

ii$.$ Prove that if Y $<=$P X and X in Co$$NP then Y in Co$$NP$.(4$ marks$)$

iii. Hence prove that if X is an NP$-$complete problem and X in Co$$NP then NP $=$

Co$$NP$.$