Just answer (a) & VERIFY YOUR ANSWER USING https://web.stanford.edu/class/archive/cs/cs103/cs103.1156/tools/cfg/ or https://checker5965.github.io/toc.html and post screenshot.

Context-Free Grammars ( 30 points - 10 each) Give context-free grammars for the following languages. Note that you may only submit one solution per language. IF you submit multiple solutions, then you will receive a zero for that question. If your grammar for L2 is unambiguous (and correct), you will receive 3 bonus points. If your grammar for L3 is in Chomsky Normal Form (and correct), you will receive 3 bonus points. (a) L1={aibjckdli+j>k or k>l}