Question $3$

In class we learned an algorithm for converting a regular expression into a NFA. Apply the conversion algorithm to the regular expression $($a$*$b$)*$ and answer the following questions about the resulting NFA. Type a single digit for each answer.

How many states are in your NFA?

How many arrows are labeled lambda?

How many arrows point at your accept state?

Answer $1$:

$3$

Answer $2$:

$3$

Answer $3$:

$2$