Exercise 1 Suppose that you are given two deterministic finite state automata M1, M2, with ni, n2 states, respectively. Show that there exists a deterministic finite state automaton M with ni x n2 states such that L(M) = L(M)\L(M), ie., L() is the set of words in L(M) but not in L(M)