a$)$ Give CFG for the language L $=\{$ anbmcn$/$ n$,$m$>=0\}.$ Show the derivation for aacc and draw the derivation tree corresponding to your derivation.b$)$ Define is Greibach Normal Form for CFGs$?$ Convert the following CFG into GNF$.$ S AS $/$ ab $/$ AB A AB $/$ BA $/$ BS $/$ a B BA $/$ bc$)$ Examine the context free Grammar representing the set of Palindrome over $(0+1)*$d$)$ Illustrate the rightmost derivation $($a$+$b$)*$c for using thegrammar and also state whethera given grammar is ambiguous one or not.EE$+$E$/$E$*$E$/($E$)/$ide$)$ Describe and draw the parse tree for the string $1+2*3$ Given the grammar G$=($V$,,$R$,$E$)$where V$=\{$E$,$D$,1,2,3,4,5,6,7,9,0,+,-,*,/,9,)\}=\{1,2,3,4,5,6,7,8,9,0,+,-,*,/,(,)\}$ where R contains thefollowing rules :ED$|($E$)|$E$+$E$|$E$-$E$|$E$/$ED$0|1|2|9$