[3] 2. The formal description of a NFA is ({q1, q2}, {0,1}, δ, q1, {q2}), where δ is given by the following
table. Give the state transition diagram of this NFA.
| | 0 | 1 | ε |
| :---- | :---- | :------- | :---- |
| q1 | {q1} | {q1, q2} | Ø |
| q2 | {q1} | {q2} | {q1} |
[4] 3. Convert given NFA to DFA for L, where L is the language recognized by NFA from question 2.
Show your work.
[4] 4. Give regular expression generating the language, recognized by NFA in question 2. Use GNFA
and state elimination technique to find it. Show your work, in particular show GNFA after eliminating
state q1.
[1] 5. Give a brief description of the language from question 2 in English.
