Please answe the question if it math no need to focus the explanation just do the math correctly with the structural way.Thank you..Tutorial Part $02$

Let $G$ be the grammar defined as:

$G=(\{S,A\},\{a,b,c,d\},P_1,(S))$

$P$:$,S$aSdd$|aAdd$

$A$bAc$|bc$

a$)$ Give a set$-$theoretic definition of $L(G).$

b$)$ Draw the state diagram $($PDA$)$ for L$($G$).$

c$)$ Write $3$ possible strings accepted by G$.$