Identify from the list below the regular expression that generates all and only the strings over alphabet {0,1} that end in 1. O a) (0?+1+)*1 b) (0+1)*10* c) (0*1)? O d) (0+1+)*1 Apply the construction in Figure 3.16 (p. 104) and Figure 3.17 (p. 105) to convert the regular expression (0+1)*(0+) to an epsilon-NFA. Then, identify the true statement about your epsilon-NFA from the list below: O a) There are 3 states with more than one arc out. b) There are no states with more than one arc in. c) There are 4 states with more than one arc in. d) There are 12 states with more than one arc in