Push It All Down

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$.)$

$B=\{w$: the number $ofa\text{'}sis$ equal $to$ the number $ofb\text{'}s$ and $c\text{'}s$ combined $\}$

Your state diagram for this question may be handwritten.