nstructions

$1.$ Let $\backslash$Sigma $=\{$ A$,$B$,$C $\}$ be an alphabet, create a finite automaton $($AFD$)$ for the languages $$and regular expressions listed below: A$($A$|$B$)$

AA

AB

ABB$*$

A$($BDC$)*$

AB$($B$)*$CA

AB$|($B$|$AA$)$B$*$A

AB$*($A$|$C$*)$