Computation Theory - Decidability

3. (10 points) Consider the following computational problems over a fixed alphabet ?. ADFA-((A, to) | A is a DFA over ?, w ?*, w e L(A) } EDFA-(A) 1 A is a DFA over ?, L(A)-0) EQDFA-{(A,B) | A and B are DFAs over ? and L(A)-L(B) } SUBDFA {(A,B) , A and B are DFAs over ? and L(A) L(B) } ALLDFA-{(A? 1 A is a DFA over ?, L(A) = ?*) INFDFA 1(A) A is a DFA over ?, L(A) is (countably) infinite} a. Find all subset relations between distinct sets in this list. That is, determine when ?? DFA S ??DFA b. Find all pairs of sets in this list that are not disjoint. That is, determine when ??DFA n ??DFA