Give the state diagram of NFAs recognizing the following languages. In all parts, the alphabet is

{0,1}.

DFA and NFA design 1. Give state diagrams of NFAs recognizing the following languages. In all parts, the alphabet (a) The language 0*110 (b) w w contains an odd number of 0s, or contains exactly two 1s) (c) w w contains the subrng 0110 2. Prove or disprove: (a) If M is a DFA that recognizes language A, swapping the accept and non-accept states in M yields a DFA recognizing A. (b) If N is a NFA that recognizes language A, swapping the accept and non-accept states in N yields a NFA recognizing A