Problem 1 In the class, we claim that is without loss of generality to assume that an NFA has only one final state." This problem asks you to prove the statement formally. More specifically, you need to show the following statement: For every NFA M (with possibly many final states), there exists an equivalent NFA M that has only one final state, ie. L(M) = L(M). Problem 2 Suppose L is a regular language. Show that LK is also a regular language Note: LR is the reverse of L, defined as wreverse string of w. Problem 3 Find an NFA that decides L(aa (a b)). Present a regular expression for the language LR