Please explain the process as well.

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