For the following language, write a Turing machine algorithm to recognize it. The language of all strings over the alphabet {x1, x2, x3, ..., xn} of the format x i1 1 x i2 2 x i3 3 ...xin n where i1i2... = in. That is, the product of the number of occurrences of of all xi up to xn1 equals the number of occurrences of the last xi (that is, of xn.)