Write a Turing machine that takes as input the unary representation of any two different numbers, separated by a blank, and halts with the representation of the larger of the two numbers on the tape. (Hint: You may need to use a "marker" symbol such as X or Y to replace temporarily any input synbols you have already processed and do not want to process again; at the end your program must "clean up" any marker symbols).
Should be in format
(Current State, Current Symbol, Next Symbol, Next State, Direction)
Example input b111b11