Build a Turing machine that takes as its input a string of the form x#b where x E {0, 1)" is a 7. binary string and b {0, 1} is a single bit, and: if b = 0, just outputs x; if b-1, flips every bit of x (i.e., changes every 0 to 1, and every 1 to 0 Before stopping, your TNI must erase #b, since the output does not include these characters