1. Consider the regular language L = {ww E {0,1}* and the 4th symbol from the beginning of w is 0}. a. Design a DFA that recognizes L, and draw the state diagram clearly marking start state and final states. Your DFA should have 6 states, with a single final/accepting state. b. Redraw your state diagram from part a, turning the start state into a final state, turning the final state into the start state, and reversing the direction of each edge. c. Is this a valid finite automaton, and if so is it deterministic or nondeterministic? Briefly explain why. d. Are any states in this new state diagram unreachable (and so unnecessary)? If so, remove them and draw the new diagram. e. Describe in English the language accepted by this finite automaton