7. Find grammars that generate the following languages: (a) L = {wcwR: we {a, b}+} over alphabet V = {a,b,c} (WR is the reverse of w). (b) L = {w: |w| mod 3 >|w| mod 2, with we {a}*} where V = {a}