Please help and show full steps will upvote thanks! Define a context-free grammar (CFG) that generates…

Please help and show full steps will upvote thanks!

Define a context-free grammar (CFG) that generates exactly the following language. B = {1’0’ik | i+j = k or i+k=j with i, j, k > 0} Both ambiguous and unambiguous grammars are acceptable (it does not matter in this question). For grading purposes, please use as the starting variable. Alphabet E = {0,1}