6. Show the steps of the Euclidean algorithm (i.e. the values of the r, x and y memory variables at each iteration of the "while" loop in Algorithm 1, Rosen p. 269) as it (a) god(18, 24) 4 points (b) ged (114, 204) 4 pointas (c) ged(1012, 1342). 4 points] (d) ged(12348, 54234). 4 points Here is a LaTeX template for tracing the algorithm: 3 x mod y 4