P2 (15x4 points] Determine whether the following languages are decidable or undecidable (3p) and prove your answer (12p). (a) CONTAINS-ALL-ONE-SERIES CFG = {{G) | G is a CFG over {0,1}* and 1* CL(G)}. (In other words, this language contains only the representations of the CFGs whose language contains all strings in the form 1*). (15p) (b) {(D) | D is a DFA that does not accept any string & {0, 1}* containing an odd number of Os}. (15p) (a) INFINITETM = {(M) | M is a TM and L(M) is an infinite language}. (15p) (b) ENEMY TM = {(M1, M2) | M, and M2 are TMs such that My accepts an input string if and only if M, rejects it}. (152)