complexity theory – Reduction between p np conp

Hello everyone I am new here on the site, I had a test a few days ago that I failed, and there was this question that I could not understand.

Given:

enter image description here

enter image description here

Question 1

Suppose there is a reduction X. Determine which of the following statements is correct:

  1. P = NP
  2. P = CoNP
  3. enter image description here because enter image description here
  4. CoNPC = enter image description here
  5. None of the above claims are true

question 2

Be C some language and assume that A and also that C. Determine which of the following statements is correct:

  1. if enter image description here then P=NP
  2. enter image description here If and only if P=NP
  3. Necessarily P = CoNP, no matter which class C. existence of such reductionism enough to conclude it.
  4. if enter image description here then enter image description here
  5. None of the above claims are true

In my opinion the answer to the first question should be 3, but I can not understand why it is correct and others are incorrect

And I also think for the second question the answer is 4, it seems very logical but I do not understand why