3. (Part A) Let G=(V, E, R, S) be a CFG that generates a language A. Prove or disprove: The CFG G' = (V, 2, RU{S + SS}, S), i.e., adding a new rule SSS to R, generates the language A*. (Part B) Give a pushdown automata (draw the state diagram) for the following language over = {a,b} L {w w has more a's than b's}. Solution