Briefly justify your answer for each statement. a. Any subset of a decidable set is recognizable. b. Any subset of an uncountable set is countable. c. Any superset of an undecidable set is uncountable. d. There is a language that is both countable and undecidable. e. There is a decidable but not recognizable language. f. The complement of a recognizable language must be recognizable. g. Every language reduces to itself. h. Every language reduces to its complement. i. For any two languages L_1, L_2, if L_1 reduces to L_2 then L_2 reduces to L_1