$2.00 closed Computability Theory Question. $2.00 closed W = { <M> | M is a DFA and L(M) is NOT a finite set}. Prove that W is a decidable language. Please write the algorithm for the machine that will decide this language. Also please add a comment t... Computability Theory Gtims123