Suppose we have two problems A and B .Problem A is polynomial-time reducible and problem B is NP-complete. If we reduce problem A into B then problem A becomes Npcomplete?

(A) True
(B) False
(C) NA
(D) NA