Q1) Write a Turing machine that reduces a positive binary number by one? By writing a turing machine, instruction set in the form of (w,x,y,z,a) where w is current state, x is current item being viewed (1,0 or b), y is what the current item is to be replaced with (1,0 or b), z is the next state to be assumed, and a is the next direction along the tape (R or L).