1. Give state transition diagram of DFAs recognizing the following languages (the alphabet is (ah a) L-the set of all strings that start with ab and have odd length b) L-the set of all strings that start with a and have even length c) L-the set of all strings that end with b and have even length d) LI UL The set of all strings such that every occurrence of a is followed by at least three bs, e.g abbb, bbbabbbabbbbabbbbbb, bbbsbb are in this language, but abab is not. The set of all strings that does not contain pattern abba g) h)