14:23 cdn.fbsbx.com Xong Name, Mat. Nr.: 7 Task 3 (10 Points): (3.A) Mark each of the following statements as true (T) or falde (F). Every NP-Complete problem is decidable. There are NP-Complete problems which are undecidable Each problem in P is also in NP. There are problems in NP which are in P. (3.B) Mark each of the following statements as true (T) or false (F). If PNP then all NP-Complete problems are not in P. If P + NP then all problems in P are not in NP. If PNP then all problema in P are not NP-complete. If PNP then the set of all NP-Complete problems is a proper subset of NP. (3.c) Mark each of the following statements as true (T) or false (F). There are NP.complete problems which are undecidable. There are decidable problems which are not NP-Complete All decidable problems are in P. No undecidable problems are in NP. (3.D) Define the Halting Problem. Input: Output: (3.) State Rice's Theorem for Recursive Sets.