Recall our design of a TM for deciding {aibjck : i j = k and i, j, k 1} by crossing off a c for each b, and repeating that whole process for each a.

Recall our design of a TM for deciding {aibjck : i × j = k and i, j, k ≥ 1} by

crossing off a c for each b, and repeating that whole process for each a. What is the big-O

time complexity of this TM in terms of the input length n?