A common definition of a Turing Machine allows for the machine to not move after reading a symbol, instead of always having to move one cell to the left or to the right. Consider a variant Turing Machine whose transition function may also produce a triple Delta function (q, s) = (q^1, a^1, S), where the.S indicates that the read/write head of the TM does not move. Describe how a standard 1-tape Turing machine can be used to simulate the running of one of these variant (but still 1-tape) machines. More precisely, given a specification T = (Q, Sigma, Delta function q_8, q_accept, q_reject) of a variant TM, give a definition of a standard TM T' which essentially does the same things that T does