Please attach a txt file which implements a Turing Machine that computes f(x) = x2 for all x 2 1. Examples of input/output for this machine: a) if input is B 11 B then output should be B1111B b) if input is B111 B then output should be B 111111111B c) if input is B 1 B then output should be B1B In each case, the machine should halt with the tape head reading the B immediately to the left of the output