We wish to perform the reduction of acceptance by a turing machine to mpcp, as described in section 9.4.3 (p. 407). we assume the tm m satisfies theorem 8.12 (p. 346): it never moves left from its initial position and never writes a blank. we know the following: (1) the start state of m is q. r is the accepting state of m.(2) the tape symbols of m are 0, 1, and b () one of the moves of m is δ(q,0) = (p,1,l). which of the following is definitely not one of the pairs in the mpcp instance that we construct for the tm m and the input 001? (a) (q0, 1p) (b) (#, #) (c) (#, #2001#) (d) (0,0)