QUESTION 6 (8 Marks) In this question, A and B are two decision problems in NP such that A SP B (there is a polynomial reduction from A to B). For each of the following statements, state whether it is true or false and provide brief reasons. a. (2 marks) If A E P then B E P b. (2 marks) If A is NP complete then B is NP-complete. c (2 marks) If 3-SAT p A then B is NP-complete. d. (2 marks) If, in addion to A KP B, B P A and the best algorithm that solves A runs in T(n), then the best algorithm that solves B runs in (T(n)