assume alphabet for each problem is sigma={0,1}

1. Consider a 3-tape TM with the number m represented by 1m on the first tape and n s m represented by 1" on the second tape. Assuming the read-write heads of both tapes are positioned at the beginning of each tape, programa the TM to write the sum m-: im-n on the third tape