Check all true statements. a. You can convert a number from binary to octal by grouping the digits ("bits") of the binary number into groups of 3, going from right to left. If the number of bits is not a multiple of 3, you may have to add one or two leading 0 bits on the left side. Then you convert each group of 3 bits into one octal digit. Expressed in base-n, the integer n² is "100".
b. In base-b, it is easy to see whether an integer is a multiple of b. Its last digit is zero in that case.
c. The security of Diffie-Hellmann Key Exchange is based on the difficulty of computing discrete logarithms.
d. In octal (base-8), every digit is 0,1,2,3,4,5,6 or 7.
e. The fast modular exponentiation algorithm computes b to the power of n space m o d space m space in only about log subscript 2 open parentheses n close parentheses steps. This enables it to be applied to extremely large n.