This question is from my Theory of Automata assignment. Can you answer this?

2. a) Using Pumping Lemma, show that the following languages are not regular. (1) L1 = {wlw {a,b}* and no prefix of w has more b's than a's} . L2 = {a'biji =j or i = 2;} (6) Find the equivalent minimized DFA for the DFA given below: 90 0,1 91 0,1 0,1 1 93 9s Page 1 of 4 (c) Let M, and M2 be the Finite Automata's shown below, recognizing the languages L and L2 respectively. 0,1 M1 A M2 800-8 B 1 Draw Finite Automata's recognizing each of the following languages: (1) LI UL2 (11) Lin L2 (111) L1 L2