Let Ak denote the language of Rice encoded strings with parameter k > 0, i.e., strings of form bobi bk-111...10, k LSBs m times where bo, b1' . . . , bk-1 E {0, 1} and k is some positive integer number, e.g., k-3. a) Is the language A3 (i) finite, (ii) infinite but countable, or(iii) uncountable? b) Design a DFA M that recognizes the language As c) Is As decidable? Let Ak denote the language of Rice encoded strings with parameter k > 0, i.e., strings of form bobi bk-111...10, k LSBs m times where bo, b1' . . . , bk-1 E {0, 1} and k is some positive integer number, e.g., k-3. a) Is the language A3 (i) finite, (ii) infinite but countable, or(iii) uncountable? b) Design a DFA M that recognizes the language As c) Is As decidable