4. Let ={b,c}. Let L2 be the language corresponding to the regular expression (cc)+bc. (a) Give a DFA (deterministic finite automaton) that accepts the language L2. (b) What is (q0,cc) for your DFA in part (a), where q0 is your initial state and is the transition function for your DFA? 3. Give a regular expression that corresponds to the language accepted by the DFA