Show that the set of strings of balanced parentheses is not defined by any regular expression. Hint: The proof is similar to the proof for the language E above. Suppose that the set of balanced strings had a deterministic finite automaton of m states.Feed this automaton m ('s, and examine the states it enters. Show that the
automaton can be "fooled" into accepting a string with unbalanced parentheses.