need help with q12 ?

360 Chapter 11 Decision Problems and the Church-Turing Thesis 12. Given an arbitrary Turing machine M and input string w, will the computation of M with input w halt in fewer than 100 transitions? Describe a Turing machine that solves this decision problem. 13. Show that the decision problem Undeci Input: Turing machine M Output: yes; if the third transition of M prints a blank when run with a blank tape no; otherwise. is decidable. The answer for a Turing machine M is no if M halts prior to its third transition. 14. Show that the decision problerm Input: Turing machine M Output: yes; if there is some strins uTf