(10 points) True/False Briefly justify each answer: a. The class of recognizable languages is closed under complementation b. If a language is undecidable then it is infinite. c. If a language A is regular and B reduces to A then B is also regular d. Suppose A is recognizable. If A reduces to B and B reduces to A then B is recognizable. 1. Recall reduction is defined in section 5.1 (it is not the same as the m-reduction of later sections)