1, Draw the state diagram for a DFA that recognizes the language of bitstrings that don't end in 01. Examples: ?, 0, 1, 10, 11, 00, 000, 010, 011, 100, 110, 111, 0000, 0010, 0011, 1100, 1110, 1111 2. Consider the NFA with alphabet (a,b), states (q, q, q, q4), start state q, set of final states(qu q1 and transition function ? defined by ?(qi,a)-{qz,G4), ?(qz,b)-(qi), ?(qia). {qz), ?(qu,b)-(qs), and ?(any other pair) . o. Draw the state diagram for this NFA. A correct diagram will have qu, q, 9 and q each inside its own circle with final states q3, q4indicated by double circles. Do not draw a dead state or a "state" for the empty set