In class, we will do simple constructions using NFAs to show that regular languages are closed

under the union, concatenation, and star operations. Use these constructions to answer this

and the next two questions. The alphabet in these questions is $\{c,d\}.$

Give the state diagram of an NFA recognizing the union of the languages

$A=\{w|w$ begins with $ad$ and ends with $ac\},$ and

$B=\{w|w$ contains $at$ least three $d\text{'}s\}.$