Problem 1.6. Describe informally a non-deterministic Turing machine that recognizes the language A consisting of strings of 0's and 1's which contain two disjoint copies of the same substring of consecutive 0's and 1's of length 10. Preciser A = {101102103102104 I 101,102,103,104 E {0, 1}it Wlth I102| = 10}. You should provide some but not all of the details to give the general idea. You may nd it convenient to use a ring machine with multiple tapes