Suppose you were to use the Euclidean Algorithm in order to find the greatest common divisor of 224 and 47. We would like to examine how many iterations of the algorithm are requires in order to calculate this GCD. For example, in finding gcd(3,17), there are 3 iterations required: Iteration 1 : 17 3-5 + 2 Iteration 2: 3 2 1+1 Iteration 3: 2-1-2 + 0 How many iterations of the Euclidean Algorithm are needed to calculate ged(47, 224)? Are 47 and 224 relatively prime Check