I am a complete beginner and cant seem to get this right in Jflap: Create a Turing machine that compares two (finite) bit strings, separated by “=”, and accepts the input if they are equal, and rejects it otherwise. For example: If the input is 1011=1101, with the read head furthest to the left, the machine will reject the input string. Approach suggestion: Cross out (with “X”) matching digits until you either find two digits that do not match or all characters in the input have become “X”.