Given regular expression (a+)*(b+a), which defines language L. a) [6] Construct an NFA that accepts L. You do not have to show all steps, but you have to follow the construction method described in class (or in the textbook). Show your solution in the form of a transition diagram (not the table). b) [3] Give a regular expression that defines LR c) [4] Prove that (LR U L) is regular, where I is the complement of L. You must write a formal proof here (your proof should be about 4-5 lines).