Given the below non deterministic Turing Machine: 1- Show the computation tree of the string #aab 2- Show the values on the three tapes of the multi-tape deterministic Turing machine equivalent to the below Turing Mchine. Show where is the location of the head on each tape at each time. Address the nodes in the computation from point 1 of this question, do not address the root node. (13 iterations) 3- Show the value of the single tape Turing machine equivalent to each of the 13 iterations the multi tape Turing machine in point 2 of the question. 90 #/#,R b/b,R q1 a/a,R a/a,R q2 a/a,R a/a,R 93 b/b,R q_accept