1. The Turing machine M has: - States q and p;q is the start state. - Tape symbols 0,1 , and B; 0 and 1 are input symbols, and B is the blank. - The following next-move function: Your problem is to describe the property of an input string that makes M halt. Identify a string that makes M halt from the list below. a) 10101 b) 0000 c) 1010 d) 010110 2. Suppose a problem P1 reduces to a problem P2. Which of the following statements can we conclude to be TRUE based on the above? a) If P1 is undecidable, then it must be that P2 is undecidable. b) If P1 is non-RE, then it must be that P2 is RE. c) If P2 is non-RE, then it must be that P1 is non-RE. d) If P1 is decidable, then it must be that P2 is undecidable