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 LI A2 is also regular expression and Justify that the new machine N accept either A or Azlanguage. [8+3+41 2h Define ansilon trunsition in NEA Find the closure of the NEAN designed in 26