XII What can you infer from the facts that PROBLEMA is NP-complete and PROBLEMA linear-time reducesto PROBLEMB? __(19)__ C1: If there exists an O(N3) algorithm for PROBLEMB, then P = NP. C2: If there does not exist an O(N3) algorithm for PROBLEMB, then P ≠ NP. C3: If there exists an O(N3) algoritlim for PROBLEMB, then there exists an O(N3) algorithm forPROBLEMA.
C4: If there exists an O(N3) algorithm for PROBLEMA, then there exists an O(N3) algorithm forPROBLEMB.
(A) C1 and C3
(B) C1 and C4
(C) C2 and C3
(D) C2 and C4