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