Q3) Let - (a, b). Construct a regular expression defining each of the following languages over 2. a) The language of all words that do not begin with ba. b) The language of all words in which the total number of b's is divisible by 3 no matter how they are distributed, c) All words that contain exactly 2 b's or exactly 3 b's, not d) All strings that have an even number of a's and an odd such as bbabbaabab. more number of b's. (08 Points)