3. [20pt] (Submit JFLAP files and a print out on your HW answers showing accepted/rejected strings). Provide the state diagrams of NFAs that recognize each of the following languages and that satisfy the given requirements. In all parts. = {0,1} (5pt each): (a) An NFA with three states that recognizes the language {w w has an odd length}. (b) An NFA with no transitions that recognizes the language {e}. (c) An NFA with seven states that recognizes the language {w w contains substring 011001}. (d) An NFA with five states that recognizes the language {w | W starts with 1 and every 0 is followed immediately by at least one 0, ercept the last 0}