Let G be the context-free grammar with non-terminal symbols V = {S, A, B}, terminal symbols Σ = {a, b}, start symbol S, and productions P: • S → ABb • S → Bb • A → aB • A → b • B → ab • B → ϵ Which of these strings can be generated by G? (a) ab (b) bb (c) baaba (d) aababb (e) abb (f) bbb