Describe, at a high level, a nondeterministic, two-tape Turing machine that takes an input of the form x#w_1#w_2#w_3#. #w_n (where n greaterthanorequalto 3 and where x and all strings w_i are strings in {a, b, c}^+) and accepts the input if and only if there exist distinct integers p, q and r in the range {1, 2, 3, ., n} such that w_p w_q w_r = x. For example, the input abbacab#ab#bbbc#abb#cca#ac should be accepted because the strings w_3 = abb, w_5 = ac and w_1 = ab can be concatenated to form x = abbacab. However, the input cccabc#aa#ab#ac#ba#bb should not be accepted as there is no way to concatenate 3 strings from w_1, ., w_n to form the string x = cccabc