The options are as follows:

1	contains an even number of a's contain no substring aa contain no substring bb at least one a and no occurance of aa
2	have odd length contain aa and ab start with aa start with a and have odd length
3	end with ab have more a' than b's start with a contain no substring bb
4	end in b contain an even number of a's contain at least one b contain more b's than a's

Question 2 2 pts The regular expression b (abb')'ab' defines the language consisting of all strings that[Se The regular expression a(aa ab +ba bb) defines the language consisting of all strings that The regular expression a (a*b)*a. defines the language consisting of all strings that [ Select ] The regular expression (b'ab a)b defines the language consisting of all strings that Select] Select]