3. NFA Design and Analysis (a) Design an NFA N with at most 5 states for the language L - {we {0, 1}* | w contains the substring 1011 or the substring 100 }. Present your NFA in the form of a state diagram and include a brief rationale for its design. (b) Prove that your NFA N of part (a) accepts the language L, i.e. prove that L(N) = L