Now consider the non-deterministic two-tape Turing machine N = ({90,91, Laccept. Preject}, {0,1}, {0,1,0},8',90 Laccept. Preject) with the transition function: 900 (91,0,, R, R) 201 0 (90,1,1, R, R); (90,1,1, R, L) qo Uu Qaccept 90 0 1 Paccept 91 0 9 0,1,0, L,L); (91,0,1,R,R) 91 1 (20,1,1,R,R) g | D| Preject Adapt the algorithm for deterministic Turing machines in order to transform N into an equivalent non-deterministic single-tape Turing machine. Now consider the non-deterministic two-tape Turing machine N = ({90,91, Laccept. Preject}, {0,1}, {0,1,0},8',90 Laccept. Preject) with the transition function: 900 (91,0,, R, R) 201 0 (90,1,1, R, R); (90,1,1, R, L) qo Uu Qaccept 90 0 1 Paccept 91 0 9 0,1,0, L,L); (91,0,1,R,R) 91 1 (20,1,1,R,R) g | D| Preject Adapt the algorithm for deterministic Turing machines in order to transform N into an equivalent non-deterministic single-tape Turing machine