4. Let M = (Q, , , s, F) be a DFA. (a) Show that for any q E Q and P Q, the following language is regular Clearly describe a procedure to construct a DFA (b) If A is a language over alphabet , define: for this language,in terms of M. def Show that if A is regular, then so is undouble(A) Example: if A = {e, 0, 11, 0010, 0101) then undouble(A)-(e, 1, 01} Hint: First consider a simpler version where I fix the "middle" state q, so: In the "real" version of the problem, the "middle state" is not fixed