Construct Deterministic Finite Automata (DFA) for the following language:1. w over the alphabet of a, b | w starts with an a and has at most one b2. w over the alphabet of a, b | w has at least three a's and at least two b's3. w over the alphabet of a, b | w begins with ab and ends with ba4. w | w begins with 01 and ends with 015. w over the alphabet of a, b | number of a's is even OR length of string is even