a. 11011 c. 010101 e. none of the above Bonus: What strings does this machine accept? 5 Show the schematic diagram of a Turing machine that accepts one or more 1's and exactly two O's What is the definition of a Turing-acceptable language? Show the generic construction of a Turing machine for a Turing-acceptable language. What is the definition of a decidable language? Show the generic construction of a Turing machine for a decidable language. Show by construction that if a language L is decidable, its complement L' is also decidable 6 7 8 9 Show that if a DFA accepts a finite language, then the language is decidable. 10 Why is the Halting problem important