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

L₂= {w {0, 1} | w contains the substring 0101}

1. Provide the formal 5 tuples(Q,, , q₀, F) for the NFA
2. Draw/provide a state diagram for your NFA

Provide at least three test casesthat prove your NFA accepts/rejects the strings from the language