(c) Show that " | T-2 and T, midrn 3. (d) Our general argument (in Section 3 is to work backwards: start from the last iteration (In, in our case we were taking n = 3) then the iteration before that (r2), then the one before that (r,), etc. Apply our argument on re- assuming that we've already done the work to show that In | re and In | Tk+1- In Tasks 34 and ??, we gave a "recipe" to proceed with the proof at step & of the proof. This gives an algorithmic flavour to our proof, where we start from Step n of the proof and then apply the steps in a loop until we reach To (for Task 34), or we start from Step 1, and then apply the steps in a loop until we reach r, (for Task ??). ask 35. Write algorithm-like loops to prove that the Euclidean algorithm reaches the god of its put a and b, supposing that the algorithm takes n steps to reach the number In. (a) Use your response to Task 26 to complete the following: Proof mn is a factor of a and b is a factor