ask you to construct TMs. Draw the automaton in the provided box. Use the format a/b,x for transition labels as described in the lecture notes. You may combine two or more such labels into one by listing them separated by vertical bars as, for example, in a/b,X I cld,Y Any spaces in a transition label will be ignored. There must be exactly one accept state, which must not have any outgoing transitions. Omit the reject state and all ransitions to the reject state. If a state has no transition under a certain symbol, this implicitly results in a transition to the reject state The input alphabet is given in each question. The tape alphabet comprises Some questions may advise to use additional tape symbols the input alphabet and the blank symbol denoted by the underscore character Your TM may take only a certain number of steps untilit haits.,The bound depends on the probiem and the input,it s chosen in a generous way, It exceeds the bound, you will have to devise a more efficient solution Please use the Precheck button to partially check your TM before submitting it to a question using the Check button penalty; you can use it any number of times and also after incorrect submissions. If your representation tails the precheck, it will fal the full check as wel passes the precheck, it may or may not pass the full check. a binary number. The input to M, is a string over (0,1). If the input is the base-2 representation of a positive integer number Construct a TM Ms which decrements n, your TM must compute the base-2 representation of n-1. Otherwise your TM must reject the input. The output must have the same num nput, which may have leading O symbols. The most significant bit of numbers is on the left, Submit a representation of Mo as described above. Answer: (penalty regime 10, 20, 96) Help