Consider the following two languages i.e. Language-1 and Language-2 to solve the given questions. Language-1: Over the { = {a,b), a language which accept all strings with four a and zero b. Language-2: Over the = {a,b), a language which accept all strings zero a and four b. PART -I a. Write Regular Expressions for the given languages. b. Construct Deterministic Finite Automata (DFA) for the given languages. Construct Transition Graphs (TG) with the minimum number of states. d. Construct a Union DFA of the given two languages. C