Answer:
d. If X is NP - complete and Y is in NP then Y is NP - complete.
This can be inferred
Explanation:
The statement d can be inferred, rest of the statements cannot be inferred. The X is in NP complete and it reduces to Y. Y is in NP and then it is NP complete. The Y is not in NP complete as it cannot reduce to X. The statement d is inferred.
~

<h3>Types of Computer games</h3>
- Action
- Adventure
- Simulation
- Sports
- Role-playing
- Puzzlers
- Party games
<em>(</em><em>That's</em><em> </em><em>all</em><em> </em><em>i</em><em> </em><em>know</em><em>)</em><em> </em>
<h2>

</h2>
~

Answer:
C. org
Explanation:
org is an open domain so anyone is allowed to register a .org domain