1. Let G be the grammar defined as: G = ({S, A}, {a, b, c, d}, P1, S) P: SaSdd | Add A AC | bc Give a set-theoretic definition of L(G). Draw the state diagram (PDA) for L(G). Write 3 possible strings accepted by G. a) b) c)