JUST ANSWER (C), and verify your answer using https://web.stanford.edu/class/archive/cs/cs103/cs103.1156/tools/cfg/

1. 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. (c) L3={ww is a binary palindrome with length divisible by 3}