Let X be a language over the alphabet {0,1}. Define the function T applied to X as T(X) = {1223... In 122...n X and 122...n>0}. In this problem, we will prove that the class of regular languages over the alphabet {0,1} is closed under the function T. (a) Finish the construction by completing the construction Setup Let A be a regular language over the alphabet = {0, 1}. Then let M be a DFA that recognizes the language A, i.e., L(M) = A such that M = (Q, E, 8, 9o, F). Construction Build a new NFA (formal definition) whose language is T(A). (b) Draw a DFA that recognizes the language L((aba)*) (include it as an image.) (no justification necessary.) (c) Use the construction above to construct an NFA that recognizes the language T(L((aba)*)). (include it as an image.) (no justification necessary.)