A. (True or False) Write the word TRUE if the statement is correct, otherwise write the word FALSE. (3 points each) (a) gcd(0, 100) = 0. (b) Icm(12, 10) = 120. (c) Euclidean algorithm is a method in finding the greatest common divisor between two integers. (d) 24 = 3 (mod 7). (e) 9 divides 10999-1. (f) 14 divides 0. (g) If a divides c and a divides d, then a divides c+d. (h) If a divides b, then b divides a. (i) 1 divides any integer n. (1) If a and b are integers, not both zero, then god(a, b) is positive