Q. No. 1: Consider = {a , b}. Construct finite automata for each of the following languages

(i) Language of all words which contain odd number of as and any number of bs (if any)

(ii) Language of all words that end with double letter:

(iii) Language of all words that start and end with different letters

(iv) Language of all words that do not contain double a in them somewhere

----------------------------------------------

the result like ( a+b)* a