Use the Euclidean Algorithm to determine the greatest common divisor of 1350 and 252. Show each step of the algorithm in form n = qd + r where d is the divisor, q is the quotient, and r is the remainder. 1350 X 252+ X -0 god(1350, 252) = As an example, the Euclidean Algorithm to find the greatest common divisor of 136 and 85 is as follows: 136 = 1 x 85 + 51 85 = 1 x 51 + 34 51 = 1 x 34 + 17 34 = 2 x 17 + 0 which shows god(136, 85) = 17