Question a. Describe in words (by describing important steps) how a 3-head deterministic Turing machine can decide the language L = {abc p0} and then do the same for the language L' = {aPbc2\p>0}. Question b. An r-tape-k-head Turing machine is a Turing machine with r-tapes and k-heads on each of these. Argue, by describing the important steps of M', that for every 3-tape-2-head Turing machine M (that is, there are 2 heads on each tape so 6 in total) there exists a deterministic one-tape-one-head (that is, a standard) Turing machine M' such that L(M)=L(M')