Explain a Turing Machine that accepts the following,

Computer Science 1a. Create a multitape Turing machine to recognize the language L = {aibjck∶0 < i < j < k}.   1b. Create a multitape Turing machine to recognize the language L = {w∶w = wR} with Σ = {a,b}.

Construct a Turing machine that accepts the language of strings of the form an, where nis a composite number. A composite number is any integer n that can be written as a product n = p ·q,where p and q are integers with 1 < p, q < n. Specifically for the purpose of this question, 0 and 1 are notconsidered composite numbers.Your machine can be non-deterministic, and it can use multiple tapes (as many as you need). I suggestbreaking up the construction into smaller sub-tasks. In particular, the machine you built in Question 3might be useful.For this question, it is enough to give a detailed description of the algorithm of your machine. You donot need to draw a full transition diagram. Although you can draw diagrams for smaller parts if it helpsyou illustrate your construction.

9. The Turing Machine M below accepts L = { a"b": n>= 1}. y:y,R а; а, R y;y, L a;a, L q1 biy.L a;x,R q0 X;X, R q2 Yiy.R y; y,R q4 0:0,L q3 Give instantaneous description traces of M on inputs w = ab; w = aab; w = aabbb, Use the instantaneous description trace format. Type your answer. Make conclusions whether or not the tested inputs are accepted or rejected by М. %%3D