i) Analyze about the "Bad Case for the Subset Construction" during DFA to NFA conversion. ii) Describe the "pigeonhole principle" regarding the subset construction.

Build in ε-NFA for the following language: L = {w | w is empty, or if non-empty will end in 01}

Convert the NFA from Question 5(a), to DFA. Question 5(a): Build an NFA for the following language: L = {w | w ends in 101}

Convert ε-NFA to DFA based on Question 6(b) Question 6(b): Build an e-NFA for the following language: L= ={w|w is empty, or if non-empty will end in 11}