1. (15 points) For each action below give the full specifications (formal description) for a Turing machine that computes it. Assume = {a, b} and= {a, b, B, X, X, $), These are routines that you can use in solving later problems. From any configuration (tape, current state), the TM will find the next B to the right of the tape head. From the initial configuration (tape, qo), the TM will put a $ as the first tape symbol and move the entire input one place right. a. b. any conig will rewind to the left end o the tape where there is a S. 1. (15 points) For each action below give the full specifications (formal description) for a Turing machine that computes it. Assume = {a, b} and= {a, b, B, X, X, $), These are routines that you can use in solving later problems. From any configuration (tape, current state), the TM will find the next B to the right of the tape head. From the initial configuration (tape, qo), the TM will put a $ as the first tape symbol and move the entire input one place right. a. b. any conig will rewind to the left end o the tape where there is a S