Draw an NFA with just two states that recognizes the language of strings of $\{a,b\}$ that contain exactly one $\text{'}$b$\text{'}.$

Using the construction NFA $-->$ DFA, draw the DFA corresponding to the NFA in Question $1.$ Remember to label your states as sets of states from the NFA.

Using our contruction Regular expression to NFA, draw the state diagram for the NFA that recognizes the language described by a$.$

Starting from the DFA shown below, use the construction DFA to Regular Expression to find a regular expression that describes the same language as is recognized by the DFA.

b$)$ Give a simple English description of the language for the DFA in Part a$.$ That means a sentence in the style of "All strings that have at least two $1\text{'}$s and end with a $10"$