Question 2: Design an NFA with at most 5 states for the language (without epsilon transitions)

L2 = {w {0, 1} | w contains the substring 0101}.

To answer Question 2, you will:

1. Provide the formal 5 tuples (Q,, , q0, F) for the NFA 2. Draw/provide a state diagram for your NFA 3. Provide at least three test cases that prove your NFA accepts/rejects the strings from the language (in the same way you did for question 1)

Example for #3 (slightly different as a NFA can branch to multiple paths; doesnt have a dead state)recall in a NFA, if a path with input can get to the final state, the string is accepted)