Problem
Construct a Standard Turing Machine M3 to compute the function f(x) = x2 where x is a postive integer represented in unary. Give a written description of the Turing Machine, a formal description and the JFLAP transition graph. What is the running time of the M3 in terms of n the unary input?