List of top Computer Science & Information Technology Questions on Computational Complexity asked in AP PGECET

Which of the following problems is in P?
A problem P is known to be NP-complete and Q and R are two problems such that Q is polynomial time reducible to P and P is polynomial time reducible to R. Which one of the following is true?