Just provide an algorithm that describes the machine's behavior

97. The Euclidean algorithm computes the greatest common divisor (GCD) of two nonnegative integers: procedure gcd(m,n): if n- 0 then return(m) else return(gcd(n,m mod n)) Give a Turing machine with input alphabet {a,#1 that on input am#an halts with agcd(mm) written on its tape. Describe the oper- ation of the machine both informally and formally. Be sure to specify all data