Construct an NFA accepting all strings that end in 101. Use the minimum number of states. Assume . Use the State Table for the NFA, (b) Convert the NFA in part (a) to a DFA, using the lazy subset construction.

= {0,1}