Please answer the question, if it is math just solve the math correctly no need to pass the time for explanation please.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$.$