Q$1$:

a$)$ Give regular expressions for the following languages. The alphabets are given at the end.

i$.$ Contains exactly one a$.\{a,b\}$

ii$.$ Has $00$ or $11$ as a substring. $\{0,1\}$

b$)$ Describe the following in English.

i$.(b|)$ :

ii$.(b(b|)|)$ :

c$)$ Draw the NFA for $($b$)($ii$).$

d$)$ Consider the following NFA and complete the corresponding DFA $($transition table$)$ below.

$\backslash$table$[[$State$,$a$,$b$,$c$,$Final$],[1,2,-,3,$No$],[,,,,],[,,,,]]$

$*$the chart continues down pleas ecomplete all parts with explanations. Will vote.