The Minimal number of final states in a minimal DFA that accepts the language: L = { w | w ϵ {0,1}* and w contains an equal occurrences of the substrings ab and ba }