Problem 5 Prove that for every nfa with an arbitrary number of final states there is an equivalent nfa with only one final state. Can we make a similar claim for dfa's? Problem 6 Prove that all finite lanquages are reqular Problem 7 Show that if L is regular, so is LR. Problem 8 Consider the dfa with initial state qo, final state q2 and Find a minimal equivalent dfa Problem 9 Find minimal dfa's for the following languages L-a:n20,n ^ 2) L-[a":n mod 3-13 Ufa n mod mod5-1) Problem 10 (class ex) Find the minimal dfa that accept L(abb)* U L(a*bb*)