3. (25 points) Let ? {0.1), consider the language L {111}, i.e., L contains a single (a) (15 points) Give a DFA with 5 states that recognizes L (You can use either a state (b) (10 points) Show that no DFA with 4 states can recognize L. Hint: show that any string with three l's. diagram or a formal description. You don't need to prove it formally) DFA with 4 states that accepts 111 must also accept some other strings