Give a Turing machine algorithm description for deciding the language A = { x#x | where x is a binary string }. To show the machine is a decider youll need to give an argument that it halts on all inputs. This is essentially the problem of checking if two numbers are equal. You do not have to implement the Turing machine, just give an algorithm in Turing-machine terms that would solve the problem.