Design DFAs to accept the following languages over the alphabet {a, b}. Show the DFAs in terms of their transition diagrams. Clearly indicate the initial state, the accepting states, and the transitions following the conventions

1. L1 is the language of all strings in which every a is immediately preceded by a b

2. L2 is the language of all strings that begin with ab and end with ba.

3. L3 is the language of all strings that contain baa as a substring

4. L4 is the language of all strings that have an odd number of as and an even number of bs.

5. L5 is the language of all strings that contain neither aa nor bb as substrings.