Describe the formal language over the alphabet {a,b,c} generated by the context-free grammar whose non-terminals are (S) and (A), whose start symbol is (S), and whose production rules are the following: (1) (S) + a(S)a (2) (S) + b(A) (3) (A) + b(A)b (4) (A) + c(A) (5) (A) + c In other words, describe the structure of the strings generated by this grammar