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.
Answer:
..
Explanation:
i dont really know. I am just answering for the sake of points lol
Is it this question? I think the hardest question in the world is the one you just asked! Am I right?
// C++ switch
// It can also be used for JAVA, C#
switch(age){
// here age will be sent by the function in which it is used
// case to check the age<2
case(age<2 && age>0):
// printing the line
cout<<"ineligible";
// case to check the age ==2
case(age==2):
// printing the line
cout<<"toddler";
// case to check 3-5
case(age>=3 && age<=5):
cout<<"early childhood";
// case to check 6-7
case(age==6 || age==7):
cout<<"young reader";
//case to check 8-10
case(age>=8 && age<=10):
cout<<"elementary";
// case to check 13
case(age==13):
cout<<"impossible";
//case tocheck 14-16
case(age>=14 && age<=16):
cout<<"high school";
// case to check 17 or 18
case(age==17 || age==18):
cout<<"scholar";
//case to check >18
case(age>18);
cout<<"ineligible";
// default case
default:
cout<<"Invalid age";
}
Read more on Brainly.com - brainly.com/question/12981906#readmore
