Give an algorithm to decide whether the language recognized by a DFA is empty. Given two DFAs M1 and M2, give an algorithm to decide whether L(M1)subset or equal to L(M2). Given two DFAs M1 and M2, give an algorithm to decide whether L(M1) = L(M2). Each algorithm should use the preceding one.