3) (20 pts) Use the Euclidean Algorithm, showing every step, to calculate each of the following greatest common divisors (ged). 1) gcd(123, 67) 2) gcd(609, 377) 3) gcd(198, 135) 4) gcd(7238, 923) 4)(30 pts) Find the remainders when dividing a by b for each of the following examples. Don't use a calculator except for individual steps. Show your work. 1) a = 745, b = 5 2) a = 112, b = 7 3) a = 1330, b = 11 4) a = 222, b = 13 5) a = 331, b = 17