$1.$ Let $=\{$a$,$b$,$c$\}.$ Provide a context$-$free grammar that generates the language $\{$ai bj ck $|$ i $=$ j or j $=$ k$\}.2.$ We observed $($without proof$)$ in class that any context$-$free grammar for the language in part $(1)$ must be ambiguous. Thus, the grammar you would have presented must be too. Exhibit this ambiguity for your grammar by showing two different parse trees for a suitably chosen string in the language