Golden rule: We only reduce problems to equivalently hard, or harder problems. Reason being that the solution to the problem-in-hand can be used to solve a harder problem.
Let A → B denote A reduces to B. Also, fact: 3-SAT is NPC.
Given that: Q1 → 3-SAT and 3-SAT → Q2.
Clearly, Q2 is at least as hard, or harder than Q1. Option B eliminated
Now, Q1 can't be NPH because Q1 is supposed to be "easier" than NPC. Option D eliminated
Option A and C can both be correct. If we choose C, then it won't be consistent because Q2 is at least as hard, or harder than NPC. Putting Q2 in NP restricts it from being NPH. Hence, A seems more correct.