For each of the following languages, draw the state diagram of a deterministic finite automaton that accepts the language.

(1) (6 marks) L4 = the set of all strings in {a, b} ∗ containing at least one occurrence of ab and at least one occurrence of ba (these occurrences may overlap, as in aaaaabaaaaaa)

(2) L5 = {w ∈ {0, 1} ∗ | w starts with 00 and does not contain two or more consecutive ones anywhere in the string}

(3) (7 marks) L6 = {w ∈ {0, 1} ∗ | w contains an odd number of ones and contains no more than 3 zeroes}