Let S be an NP-complete problem. Q and R are other two problems not known to be NP. Q is polynomial time reducible to S and S is polynomial time reducible to R. Which of the
following statements is true?

A

R is NP-complete

B

R is NP-hard

C

Q is NP-complete

D

Q is NP-hard