Simplify the given grammar:
A-> a| aaA| abBc
B-> abba| b
(a) A-> a| aaA| ababbAc| abbc
(b) A-> a| aaA| ababbAc| abbc, B-> abba|b
(c) A-> a| aaA| abbc, B->abba
(d) None of the mentioned
The question was asked in an online interview.
My enquiry is from CFG-Eliminating Useless Symbols in division Properties of Context Free Languages of Automata Theory