Consider the following languages A and $B$

$A=\{win\{0,1{\}}^{**}|$ every $1inwis$ immediately followed $byat$ least one $0\}$

$B=\{win\{0,1{\}}^{**}|w$ has $an$ odd number $of$ zeroes $\}$

Draw the state diagram of the DFA of the following language: $AB$

It may help to first construct the DFAs for A and $B.$

Draw the state diagram of the NFA of the following languages: $(A{)}^{**}$@$B$