2(50 Show points) to use the following deciders (Turing machines) as a subroutine: that the following languages are decidable. Note that you are allowed 1 TM M that decides ADFA from Theorem 4.1 2 TM N that decides ANFA from Theorem 4.2 3 TM P that decides AREx from Theorem 4.3 4 TM T that decides EpFA from Theorem 4.4 5 TM F that decides EQDFA from Theorem 4.5 Also assume that a Turing machine can construct DFA based on closures of regular languages and perform conversions among DFA, NFA, and regular expression. Note that for each of your Turing machine, you MUST explain why it demonstrates that the language is decidable (your machine is always halt and your machine is a decider for the language). CS 1502 -Formal Methods in Computer Science Page 1 Assignment 6 (90 Points) (a) Show that the language from the question 1(b) is decidable. (b) Show that the language from the question 1(c) is decidable. (c) Show that the language from the question 1(d) is decidable. (d) Show that the language from the question 1(e) is decidable. For this question, simply construct a Turing machine. You do not have to show that your machine is a decider for the language. (e) Show that the language from the question 1(h) is decidable. For this question simply construct a Turing machine. You do not have to show that your machine is a decider for the language