Convert the following NFA into an equivalent DFA (Initial state is q0 and final states are q1 and q3.) sigma = {0, 1} (Show a transition table too!) Find a Regular expression for L = {V, W_1 W_2 V, W element {a, b}*, |V| = 2} (P87 of Linz's 5^th ed. textbook) Find dfa's that accept the following languages. (a)L = L (ab *a *) L ((ab) * ba). L = L (ab * a *) L ((ab)* ba). Find Regular Expressions for the following languages. all strings not ending in ab sigma ={a, b} L_3 = {w: |W| mod 3 notequlato 0} sigma = {a, b} L_4 = {W: NA (w) mod 3 > 1} sigma = {a, b} All strings that containing no more than two 'a' s| sigma = {a, b, c}