Use the construction in the proof of $\text{Theorem 1.49}$ to give the state diagrams of $NFA's$ recognizing the star of the languages described in
- $\text{\{w| w contains at least three 1s\}}$
- $\text{\{w| w contains at least two 0's and at most one 1\}}$
- $\text{The empty set}$