1. (50 points) Please prove that language L is decidable. Functions n (x) and nsx) are the numbers of a’s and b’s in string r, respectively. In your proof, you can use any decider that we have studied in the class. (Hint: the intersection of a context-free language and a regular language is still context free. Textbook Problem 2.18) {(D》 | D is a DFA with alphabet {a, b), and there exists
OR
OR