Consider the following grammar G = ({S}, {(,)}, R, S) with rules R given by S (S) | SS 1. Derive 3 strings in L(G). 2. Describe the language L(G) in English. 3. Draw a PDA that recognizes L(G). 4. Show L(G) is not regular by using the pumping lemma.