2. A TM that compares two binary numbers. separated by =. and accepts the input if they are equal. or rejects the input it they are unequal. For example: If the input is 1c 1 1 =1 1 o 1. with the read head at the leftmost 1. then the machine will reject the input. You do not have to worry about the case where the read head starts in the wrong place. Suggested approach: X out the matching digits of the two numbers until either you nd a pair of digits that don't match. or everything is X'd out. 3. A TMthat compares two binary numbers. separated by >. and acceptsthe input if the first number is larger than the second. and rejects the input otherwise. For example: If the input is 10 1 1 2:11] 1 1. with the read head at the leftmost 1. then the lel will reject this input. You do not haye to worry about the case where the read head starts in the wrong place. Suggested approach: Ftepeatedly subtract 1 from each of the numbers. until one or both of them consists of all zeros