Check all the statements that are true:

a. you can block covert a binary number to octal by grouping the binary digits into blocks of 3 and converting each block into an octal digit.
b. if p and q are distinct primes, then the lcm of p2q and pq2 is pq.
c. an integer is divisible by b if the last digit in its base-b expansion is zero.
d. if a has n distinct prime factors and b has m distinct prime factors and n> m, then ab has at least m and at most n distinct prime factors.
e. there is a way to perform block conversion of binary number into decimal.
f. if a has n distinct prime factors and b has m distinct prime factors and n> m, then ab has at least n and at most n+m distinct prime factors.
g. the lcm of two distinct prime numbers is their product.
h. the gcd of p2q3 and p4q is p6q4.
i. using fast modular exponentiation, we can computer an mod b in order of log(n) steps.
j. the euclidean algorithm always terminates because the remainders are integers, get smaller with each step and are bounded below by 1.