Solve problem $4$ on page $532.$ However, you must use the alphabet $\{$a$,$ b$\}$ instead of $\{0,1,2,3,4,5,6,7,8,9\}.$ Assume

that the input is formatted as shown on page $532.$ Remember that, in the end, the two $$numbers$($here$,$ strings of as and bs$)$ must

be right$-$aligned. Your machine may not use the left half of the tracks $($i$.$e$.,$ to the left of the input$)$ or the bottom track. You must

save your answer in a file called problem$1.$jff

In the description of the algorithm for the $3$TM that does decimal addition "the way humans do$,"$ we skimmed too quickly over the conversion of data section. The input is pre$-$sumed to be placed on track $1$ as two numbers separated by delimiters $-$ for example,

The question of putting the second number onto the second track is a problem that w

ignored in the discussion in the chapter. Write a $3$TM subprogram to do it$.$