20 points Consider the following CFG 3a 15 points Prove that the language generated by this grammar consists of all bit strings having an equal number of a's and b's. (Note: It is not enough to show that every string generated by the grammar has that property. You must also show that every string with that property can be generated by the grammar.) 3b. [5 points] Prove that this grammar is ambiguous