Problem 3. REs (a) Consider the problem of deciding if a given RE over the alphabet ta, b, c) generates any strings where the number of a's and b's together is even. Formulate it as a language A-B-EVEN-RE, and then show that this language is decidable Hint: look at the book's solution for problem 4.12 (b) Given two RE's R1 and R2, consider the problem of deciding whether L(RI) is a subsct of L(R2).Formulate it as a language SUBSET-RE, and then show that this language is decidable. Problem 3. REs (a) Consider the problem of deciding if a given RE over the alphabet ta, b, c) generates any strings where the number of a's and b's together is even. Formulate it as a language A-B-EVEN-RE, and then show that this language is decidable Hint: look at the book's solution for problem 4.12 (b) Given two RE's R1 and R2, consider the problem of deciding whether L(RI) is a subsct of L(R2).Formulate it as a language SUBSET-RE, and then show that this language is decidable