[5 points) Choose TRUE or FALSE or OPEN for each of the following claims. Note that OPEN means that the claim may be true and may also be false, depending on the specific situations. Just make your choice; no need to explain your reasons. (a) Claim: Every problem that can be solved in polynomial time non-deterministically can be solved by a polynomial time deterministic algorithm. (b) Claim: If an NP-complete problem is shown to have a polynomial-time deterministic algorithm, then it can be concluded that P = NP. (c) Claim: For two given problems X and Y where X