Select all the grammars below which correctly generate the language: L = {a^n ww^R c^n+2 bb;w elementof{a, b}*, n greaterthanorequalto 0} Assume that the start variable is S. {S rightarrow Abb A rightarrow aAc|Bcc B rightarrow aBa|bBa| lambda {S rightarrow aSc|A A rightarrow Bccbb B rightarrow aBa|bBb |lambda {S rightarrow Accbb A rightarrow aAx|bAb|aAa|lambda {S rightarrow Acbb A rightarrow aAc|Bc B rightarrow aBa|bBb|lambda {S rightarrow Abb A rightarrow aAcc|B B rightarrow aBa|bBb|lambda {S rightarrow Accbb A rightarrow aAc|B B rightarrow bBb|aBa|lambda