(a) (15 points) 2. Consider the following two sets of Let A be a language that is neither empty nor anguages: Prove that one of these sets is countable and the other one is uncountable. (b) (10 points) Let L be any language that is not Turing-recognizable. Define the language L' = {x| (x has odd length and x E L) or (x has even length and x L) Show that L' and its complement cannot both be Turing-recognizable