please help me with this problem.

Thank you a lot

Problem 2 Let T1 be the Turing machine (whose transition diagram is) shown in Figure 2 0?R 0?R 42 start acc 0?R 43 12 Figure 2: The Turing machine T1 a. (2 points) Is T1 a deterministic or nondeterministic Turing machine? Explain your answer. b. (6 points) Does Ti accept the empty string, i.e., ? E L(T,)? Explain your answer. Hint: Show all possible computations (sequences of configurations) starting with the initial configuration Co = g-tar,D c. (6 points) Does T1 accept the string 0010? Explain your answer and in particular, if your answer is Yes, show an accepting sequence of configurations d. Let L? = L(A) be the language recognized by T. 1. (7 points) Is li co-recognizable, i.e., is its complement li recognizable? 2. (4 points) Let w = 0"110". Does ,w) E HALTru