2. Let S = {0,1}. Let L be the language consisting of the set of all strings over that contain the substring 10 and have last character a 1. (Note that 10 and 1 are not in L. The string 101 and the string 10101 are two examples of strings that are in L-) (a) Give a DFA (deterministic finite automaton) that accepts the language L. (b) What is S* (40,000) for your DFA in part (a), where qo is your initial state and 8 is the transition function for your DFA