Define a decision procedure for each of the following questions. Argue that each of your decision procedure gives the correct answer and terminates.
(a) Given 2 DFSM's M! and M2 is L(M1) = L(M2)^r?
(b) given a fsm M and a regular expression w, is it true that both L(M) and L(w) are finite and M accepts exactly 2 or more strings than w generates