Thanks!

Question 1 A recursive definition for the language EVENandAB over the alphabet y a b) must be compiled where ODDandAA consists of all words of odd length and containing the substring ab. (i) (ii) the generator(s) of EVENandAB, and (ii) an appropriate function on the (iv) use these concepts to write down a recursive definition of the language EVENandAB. Give an appropriate universal set, universal set, and then