2(a). Define Regular expression with application. Suppose 101 is string of language A and 110 is another string of language A2 respectively. Prove that A, U Azis also regular expression and Justify that the new machine N accept either A, or Azlanguage. 18+3+41 2(b). Define epsilon transition in NFA. Find the E-closure of the NFA N designed in 2(a). 20). Define extended transition function. How extended transition function work in DFA? Explain with example