P2 [15x4 points] Determine whether the following languages are decidable or undecidable ( 3p) and prove your answer (12p). (a) CONTAINS-ALL-ONE-SERIES SCFG={GG is a CFG over {0,1} and 1L(G)}. (In other words, this language contains only the representations of the CFGs whose language contains all strings in the form 1 ). (15p) (b) {DD is a DFA that does not accept any string x{0,1} containing an odd number of 0 s }. (15p) (c) INFINITE TM={MM is a TM and L(M) is an infinite language }. (15p) (d) ENEMY YTM={M1,M2M1 and M2 are TMs such that M1 accepts an input string if and only if M2 rejects it }. (15p)