Problem 2 In the class, we claim that it 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, i.e. L(M)=L(M'). Bonus: prove that the above statement does not hold for DFA. In particular, there exists a regular language such that there does not exist any DFA with only one single final state that decides the language. Hint: Consider Problem 1. Try to figure out the bonus question on your own. You cannot ask the instructor or the TA for help before the due day for this