Q. Let S be an NP-complete problem, Q and R be two other problems not known to be in NP. Q is polynomial-time reducible to S and S is polynomial-time reducible to R. Which one of the following statements is true? (Solved)
1. R is NP-complete
2. R is NP-hard
3. Q is NP-complete
4. Q is NP-hard
- a. R is NP-complete