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, am #an halts with aged(mm) written on its tape. Provide an algorithm describing its behavior. that on input