Studying material is s hard.. can't even understand.. Please help..

2. (10 points) (a) Define SUBDFA = {(A, B) | A and B are DFAs and L(A) C L(B)) Prove that SUBDFA is decidable. b) Define DIS/DFA-{(A,B) | A and B are DFAs and L(A)n L(B) 0) Prove that DISJDFA is decidable. (c) Define FINDFA A) A is a DFA over , L(A) is finite) Prove that FINDFA is decidable. Hint: you might find ideas from the Pumping Lemma useful. 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. 2. (10 points) (a) Define SUBDFA = {(A, B) | A and B are DFAs and L(A) C L(B)) Prove that SUBDFA is decidable. b) Define DIS/DFA-{(A,B) | A and B are DFAs and L(A)n L(B) 0) Prove that DISJDFA is decidable. (c) Define FINDFA A) A is a DFA over , L(A) is finite) Prove that FINDFA is decidable. Hint: you might find ideas from the Pumping Lemma useful. 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