Construct the CFG for the given language. Illustrate the parse tree, Leftmost derivation and right most derivation for the given string.

a$)|i+k$ and $\{$:$i.j,k0\}$

b$)$ R$.$E $=0011$

Construct the CFG for the given language. Illustrate the parse tree, Leftmost derivation and right most derivation for the given string.

a$)L=\{a^n{b}^{2n}|n>0\}$

b$)|=b$ and $\{$:$a,b,c0\}$

c$)L=\{a^{}{b}^m{c}^n|n,m>0\}$