Please answer C and D using the diagram given

Using the knowledge of chapter $2$ and $3$ to answer the following questions

a$.$ Write down at least the shortest $8$ items of 'string which start with two

consecutive $1\text{'}$s and end with $1$ number, $0$ or $1\text{'}($e$.$g$.110,11111).(5$ points$)$

b$.$ What is the regular expression for that? $(5$ points$)$

Note: $A^{**}A=A^{+}$

c$.$ Draw a nondeterministic finite automaton for the regular expression $(10$

points$)$

Note: NFA for regular expression A$+$:d$.$ Transform the NFA to DFA $(10$ points$)$

e$.$ What is the table$-$driven implementation of the DFA? $($just draw the $2$D table$)$

$(5$ points$)$

Using the knowledge of chapter $2$ and $3$ to answer the following questions

a$.$ Write down at least the shortest $8$ items of 'string which start with two

consecutive $1\text{'}$s and end with $1$ number, $0$ or $1\text{'}($e$.$g$.110,11111).(5$ points$)$

b$.$ What is the regular expression for that? $(5$ points$)$

Note: $A^{**}A=A^{+}$

c$.$ Draw a nondeterministic finite automaton for the regular expression $(10$

points$)$

Note: NFA for regular expression A$+$: