Prove that the CFG generates the set of all strings over a, b with equally many a's and b's. (Hint: Characterize elements of the set in terrns of the graph of the function #b(y)-#a(y) as y ranges over prefixes of x, as we did in Lecture 20 with balanced parenthesis.)