1) Write a transition diagram for a Turing Machine that satisfies the following specifications. Do not make it skeletal -- show all possible transitions. (That means 3 transitions from each state (except the halt state) since = {x, y, } for this problem.)

Pre: | alpha .... where alpha is a string of letters from {x,y} and ... are all

Post: if alpha is in the language described by regular expression (xy)* halt in the leftmost cell with the tape unchanged. Otherwise, make an abnormal termination occur.