Let Σ= {a, b}. Construct a DFA for the language L = { w Σ* | w contains the same number of instances of the substring ab and the substring ba}. Note that substrings are allowed to overlap, so we have aba element of L (one copy of each substring) and babab element of L (two copies of each substring).
