Given the context$-$free grammar $($CFG$)$ G provided below:G$=$ S$->$ABA$->$ aAb $|$ abB$->$ bBa $|$ a$)$ What is the minimum sequence that can be generated by the grammar G given below?b$)$ Show the leftmost derivation steps to generate the sequence "aabbbbaa" in accordance with the grammar.c$)$ What is the relationship between the numbers of input symbols $\text{'}$a$\text{'}$ and $\text{'}$b$\text{'}$ according to this grammar? What is the order of production for input symbols?d$)$ Determine the language of the grammar. L$($G$)=\{|\}$