PLEASE ANSWER ALL

Problem 6 Let G be a left-linear grammar, and let G be the grammar as we defined in the class: G has the same terminal and variable sets as those of G. Furthermore, if G has a production rule A Aw then has a production rule A -wRA, where wR is the reverse of the string w. . Prove that L(G) = LR(G). Show that there exists a right-linear grammar for the language L(G). Note 1: You can use the fact that every right-linear grammar produces a regular language, and vise versa, as we did in the class. But you cannot assume the same rest for le This problem asks you to prove it Note 2: You can use any conclusion of our homework assignments directly. ftlinear grammars