2. (10 points) Consider the following computational problems: EQDFA = {(A,B) 1 A and B are DFAs and L(A) = L(B)) SUBDFA = {(A,B) | A and B are DFAs and L(A) L(B)) DISJDFA-{(A, B) | A and B are DFAs and L(A) n L(B)-0} Prove that SUBDFA and DISJDFA are each Turing-decidable. You may (and should) use high-level descriptions of any Turing machines you define. Make sure to provide both a machine definition and a proof of correctness