Give the state diagram for a pushdown automata which decides exactly the following language, $\backslash$Sigma $=\{$a$,$ b$,$ c$,$ d$\}$Give the state diagram for a pushdown automata which decides exactly the following language, $=\{a,b,c,d\}$

$($Note that $d$ is also in the alphabet and strings in the language may contain any number of $d\text{'}$s$.)$

: the number of a$\text{'}$s is equal to the number of b$\text{'}$s and c$\text{'}$s combined

$($Note that d is also in the alphabet and strings in the language may contain any number of d$$s$.)$

B $=\{$w : the number of a$$s is equal to the number of b$$s and c$$s combined$\}$

Your state diagram for this question may be handwritten.