1. Give state diagram of DFAs recognizing the following languages (the alphabet is {a,b}): g) The set of all strings such that every occurrence of a is followed by at least three bs.e.g., bbabbbb, abbb, b, babbbbabbbabbbbbbabbbbbbb are in this language, but babb is not. h) The set of all strings that does not contain pattern aaba. i) The set of all strings except bab and aa. j) The set of all string such that every odd position contains b. For example, bbb, bab, bababa are in this language, but abb and bbab are not